paper-with-me

Papers

Unlocking Exploration in RLVR: Uncertainty-aware Advantage Shaping for Deeper Reasoning

2025-10-12 · Can Xie, Ruotong Pan, Xiangyu Wu, Yunfei Zhang, Jiayi Fu, Tingting Gao, Guorui Zhou arxiv

Reinforcement Learning with Verifiable Rewards (RLVR) has shown significant promise for enhancing the reasoning capabilities of large language models (LLMs). However, prevailing algorithms like GRPO broadcast a uniform advantage signal across all tokens in a sequence. This coarse-grained approach overlooks the pivotal role of uncertain, high-stakes decisions during reasoning, leading to inefficient exploration and the well-documented problem of entropy collapse. To address this, we introduce UnCertainty-aware Advantage Shaping (UCAS), a model-free method that refines credit assignment by leveraging the model's internal uncertainty signals. UCAS operates in two stages: it first modulates the response-level advantage using a logit-space self-confidence proxy, and then applies an asymmetric token-level penalty based on raw logit certainty. This dual mechanism encourages exploration of high-uncertainty paths that yield correct answers while penalizing overconfident yet erroneous reasoning, effectively balancing the exploration-exploitation trade-off. Extensive experiments on five mathematical reasoning benchmarks show that UCAS significantly outperforms strong RLVR baselines across multiple model scales, including 1.5B and 7B. Our analysis confirms that UCAS not only achieves higher rewards but also promotes greater reasoning diversity and successfully mitigates entropy collapse. Code is available at https://github.com/xvolcano02/UCAS.

📄 PDF Abstract BibTeX arXiv:2510.10649

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement LearningMathematical Reasoning

Similar Papers 제목 키워드 기반

Unlocking Reasoning Capabilities in LLMs via Reinforcement Learning Exploration

2025-10-04 · Wenhao Deng, Long Wei, Chenglei Yu, Tailin Wu arxiv

Reinforcement learning with verifiable rewards (RLVR) has recently enhanced the reasoning capabilities of large language models (LLMs), particularly for mathematical problem solving. However, a fundamental limitation rem…

Reinforcement Learning

Beyond Entropy: Correctness-Aware Advantage Shaping via Contrastive Policy Optimization

2026-07-16 · Weiwen Xu, Jia Liu, Hou Pong Chan, Long Li 외 arxiv

Reinforcement learning with verifiable rewards (RLVR) commonly uses entropy for advantage shaping. However, entropy cannot distinguish useful uncertainty from detrimental confusion, limiting its effectiveness as a correc…

Reinforcement Learning

Depth-Breadth Synergy in RLVR: Unlocking LLM Reasoning Gains with Adaptive Exploration

2025-08-19 · Zhicheng Yang, Zhijiang Guo, Yinya Huang, Yongxin Wang 외 arxiv

Reinforcement Learning with Verifiable Reward (RLVR) is a powerful method for enhancing the reasoning abilities of Large Language Models, but its full potential is limited by a lack of exploration in two key areas: Depth…

Reinforcement Learning

Adaptive Ability Decomposing for Unlocking Large Reasoning Model Effective Reinforcement Learning

2026-01-31 · Zhipeng Chen, Xiaobo Qin, Wayne Xin Zhao, Youbin Wu 외 arxiv

Reinforcement learning with verifiable rewards (RLVR) has shown great potential to enhance the reasoning ability of large language models (LLMs). However, due to the limited amount of information provided during the RLVR…

Reinforcement Learning

Reinforced Efficient Reasoning via Semantically Diverse Exploration

2026-01-08 · Ziqi Zhao, Zhaochun Ren, Jiahong Zou, Liu Yang 외 arxiv

Reinforcement learning with verifiable rewards (RLVR) has proven effective in enhancing the reasoning of large language models (LLMs). Monte Carlo Tree Search (MCTS)-based extensions improve upon vanilla RLVR (e.g., GRPO…

Reinforcement LearningMathematical Reasoning