arXiv AI By Lianfa Li

Bellman-Consistent Trajectory RL for LLM Arithmetic Reasoning

Read the original on arXiv AI →

The paper introduces a Bellman-consistent trajectory reinforcement learning approach for large language model (LLM) arithmetic reasoning, called Trajectory Bellman Residual Minimization (TBRM). By converting sparse terminal rewards into dense token-level signals and employing a Reinforce Leave-One-Out (RLOO) strategy to reduce gradient variance, the method improves learning stability. On the Countdown task, TBRM-RLOO achieves Pass@1 scores of 0.55–0.64 and a state-of-the-art Pass@16 accuracy of 76.0–84.0%, surpassing several baseline methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Oct 12

Trajectory-Aware Policy Optimization: Closing the State Distribution Gap in Long-Horizon LLM RL

The paper introduces Trajectory-Aware Policy Optimization (TAPO), a new framework for reinforcement learning that addresses the state distribution shift caused by long-horizon autoregressive rollouts in large language models. TAPO derives a state-distribution correction from the off-policy policy gradient, integrates it into the RL objective, and uses a geometric-mean estimator for variance reduction along with length-aware dynamic clipping to stabilize updates. Experiments on eight competition-level benchmarks show TAPO outperforms existing LLM RL methods, achieving up to 48% improvement on mathematical reasoning and 12% on algorithmic coding tasks while enhancing training stability.

By Zhicheng Cai, Weinan Dai, Yuyan Zhou, Wei-Ying Ma, Ya-Qin Zhang, Hao Zhou
arXiv AI
Oct 2

Rethinking Probability-Based Reinforcement Learning From Posterior Concentration

The paper introduces the Posterior Concentration Phenomenon (PCP), a length‑dependent failure mode where probability‑based rewards collapse to a narrow interval for long reasoning traces, destabilizing verifier‑free reinforcement learning. To address this, the authors propose RLCPR, a framework that uses uncertainty‑aware data sampling and concentration‑aware regularization to mitigate PCP, improving token efficiency and outperforming state‑of‑the‑art baselines on multiple reasoning benchmarks.

By Shiu-Hong Kao, Yubo Zhao, Zhenyu Tian, Pengzhan Sun, Yicong Li, Angela Yao