Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.23808 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915945177415680 |
|---|---|
| author | Huang, Fanding Huang, Guanbo Fan, Xiao He, Yi Liang, Xiao Chen, Xiao Jiang, Qinting Khan, Faisal Nadeem Jiang, Jingyan Wang, Zhi |
| author_facet | Huang, Fanding Huang, Guanbo Fan, Xiao He, Yi Liang, Xiao Chen, Xiao Jiang, Qinting Khan, Faisal Nadeem Jiang, Jingyan Wang, Zhi |
| contents | Reinforcement Learning with Verifiable Rewards (RLVR) for LLM reasoning is often framed as balancing exploration and exploitation in action space, typically operationalized with token-level proxies (e.g., output entropy or confidence). We argue that this apparent trade-off is largely a measurement artifact: token-level statistics reflect next-token uncertainty rather than how reasoning progresses over multi-token semantic structures. We therefore study exploration and exploitation in the hidden-state space of response trajectories. We use Effective Rank (ER) to quantify representational exploration and introduce its temporal derivatives, Effective Rank Velocity (ERV) and Effective Rank Acceleration (ERA), to characterize exploitative refinement dynamics. Empirically and theoretically, ER and ERV exhibit near-zero correlation in semantic space, suggesting the two capacities can be improved simultaneously. Motivated by this, we propose Velocity-Exploiting Rank Learning (VERL), which shapes the RLVR advantage with an auxiliary signal derived from ER/ERV and uses the more stable ERA as a meta-control variable to adaptively balance the incentives. Across multiple base models, RLVR algorithms, and reasoning benchmarks, VERL yields consistent improvements, including large gains on challenging tasks (e.g., 21.4\% in Gaokao 2024). The code is available at https://github.com/hf618/VERL. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_23808 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Semantic-Space Exploration and Exploitation in RLVR for LLM Reasoning Huang, Fanding Huang, Guanbo Fan, Xiao He, Yi Liang, Xiao Chen, Xiao Jiang, Qinting Khan, Faisal Nadeem Jiang, Jingyan Wang, Zhi Machine Learning Computation and Language Reinforcement Learning with Verifiable Rewards (RLVR) for LLM reasoning is often framed as balancing exploration and exploitation in action space, typically operationalized with token-level proxies (e.g., output entropy or confidence). We argue that this apparent trade-off is largely a measurement artifact: token-level statistics reflect next-token uncertainty rather than how reasoning progresses over multi-token semantic structures. We therefore study exploration and exploitation in the hidden-state space of response trajectories. We use Effective Rank (ER) to quantify representational exploration and introduce its temporal derivatives, Effective Rank Velocity (ERV) and Effective Rank Acceleration (ERA), to characterize exploitative refinement dynamics. Empirically and theoretically, ER and ERV exhibit near-zero correlation in semantic space, suggesting the two capacities can be improved simultaneously. Motivated by this, we propose Velocity-Exploiting Rank Learning (VERL), which shapes the RLVR advantage with an auxiliary signal derived from ER/ERV and uses the more stable ERA as a meta-control variable to adaptively balance the incentives. Across multiple base models, RLVR algorithms, and reasoning benchmarks, VERL yields consistent improvements, including large gains on challenging tasks (e.g., 21.4\% in Gaokao 2024). The code is available at https://github.com/hf618/VERL. |
| title | Semantic-Space Exploration and Exploitation in RLVR for LLM Reasoning |
| topic | Machine Learning Computation and Language |
| url | https://arxiv.org/abs/2509.23808 |