Sign inGet started
Paper · arXiv

Understanding and Preventing Entropy Collapse in RLVR with On-Policy Entropy Flow Optimization

Reinforcement learning with verifiable rewards (RLVR) has become an effective paradigm for improving the reasoning ability of large language models. However, widely used RLVR algorithms, such as GRPO, often suffer from entropy collapse, leading to premature determinism and unstable optimization. Existing remedies, including entropy regularization and ratio-based clipping heuristics, either control entropy in a coarse-grained manner or rely on approximate on-policy training. In this paper, we revisit entropy collapse from a token-level entropy flow perspective. Our analysis reveals that entropy-decreasing tokens consistently outweigh entropy-increasing ones, resulting in a severely imbalan...

AuthorsHuimin Xu, Shuai Zhao, Xiaobao Wu et al.
Primary categorycs.LG
Published12 May 2026
Last updated at source12 May 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/7f61f6c4-86f4-44a7-a3d8-193ec5390fa8" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.