Reinforcement learning with verifiable rewards (RLVR) makes a language model solve more problems on the first try and fewer when given many tries: it raises pass@1 while the base model overtakes it at...
The paper proves that in reinforcement learning with verifiable rewards (RLVR), any improvement in pass@1 necessarily incurs a cost in pass@k, establishing a precise price for such gains. By modeling RLVR as an exponential tilt of a base policy, the authors show that every update that raises pass@1 strictly lowers success on at least one prompt, and that the number of pass@k crossovers is bounded by the sign variation of per‑prompt success shifts. The work also derives an entropy‑performance law and provides a diagnostic to measure this price from evaluation logs.
By Yinuo Liu
arXiv:2611.05942v1 Announce Type: new
Abstract: RL for LLM reasoning often reaches an early performance plateau as the policy distribution becomes increasingly sharp. Recent work has studied policy e...
By Mengni Jia, Mengyu Zhou, Xiaoxi Jiang, Guanjun Jiang
arXiv:2609.09075v1 Announce Type: cross
Abstract: In reinforcement learning with verifiable rewards (RLVR) trained with group relative policy optimization (GRPO), the KL-free reward-advantage term st...
By Tommy Sha, Skylar Zhai, Siqi Zhao
arXiv:2606. 19236v1 Announce Type: cross Abstract: Reinforcement Learning with Verifiable Rewards algorithms like GRPO have emerged as the dominant post-training paradigm for complex reasoning in LLMs, yet commonly suffer from policy entropy collapse during training.
By Haipeng Luo, Qingfeng Sun, Songli Wu, Can Xu, Wenfeng Deng, Han Hu, Yansong Tang
arXiv:2606. 19771v1 Announce Type: new Abstract: Reinforcement Learning with Verifiable Rewards (RLVR) has significantly advanced Large Language Model (LLM) reasoning; however, it faces a fundamental optimization instability: uniform token updates precipitate entropy collapse, leading to premature convergence to suboptimal strategies, whereas excessive Shannon Entropy maximization can cause entropy explosion, driving blind exploration toward incoherent reasoning chains.
By Xuanzhi Feng, Zhengyang Li, Zeyu Liu, Haoxi Li, Yuming Jiang, Bing Guo, Jingcai Guo, Jie Zhang, Song Guo