When answers all score the same, the task signal goes quiet and a background pressure silently collapses the model toward one generic response.
How does regularization dominance explain policy entropy collapse in reasoning?
This explores a specific mechanism behind entropy collapse: the idea that when the learning signal weakens, the *regularizer* (the term meant to keep the policy well-behaved) quietly takes over and steers the model toward generic, low-entropy outputs.
This explores why reasoning policies collapse toward narrow, repetitive outputs — and the corpus points to a subtle culprit: when the actual task signal goes quiet, the regularization term becomes the loudest voice in the room. The clearest account is that policies collapse into input-agnostic templates when within-prompt reward variance is low: if every sampled answer to a prompt earns roughly the same reward, the task gradient nearly cancels out, and whatever regularizer is present starts dominating the update — pushing the model toward a generic, safe output that ignores the specifics of the input Why do language models collapse into generic templates?. Entropy doesn't collapse because the model 'decided' to stop exploring; it collapses because the only remaining pressure on the weights is the flattening, mean-reverting pull of regularization.
That mechanism sits underneath the broader empirical picture of entropy collapse as the primary bottleneck in RL for reasoning. Performance follows a tight law, R = -a·exp(H) + b, where gains saturate exactly as policy entropy approaches zero — so anything that accelerates the drain toward zero entropy also caps how good the model can get Does policy entropy collapse limit reasoning performance in RL?. Regularization dominance is one accelerant: on low-variance prompts it spends update after update narrowing the distribution without ever teaching anything, burning through exploratory capacity for no reward gain.
The fix that falls out of this framing is telling. If the problem is low reward variance handing control to the regularizer, then the answer isn't a bigger entropy bonus everywhere — it's picking the *right* prompts. SNR-aware filtering selects high-variance prompts before doing updates, so the task gradient stays strong enough to keep regularization in check, and this recovers performance across tasks and scales Why do language models collapse into generic templates?. This dovetails with the finding that only a minority of tokens — the roughly 20% high-entropy 'forking' decisions — actually carry the RLVR learning signal; when variance collapses, those pivotal forks are exactly what get ironed flat first Do high-entropy tokens drive reasoning model improvements?.
What makes this more than a reasoning-specific quirk is that the same collapse shows up wherever RL narrows behavior. Search agents lose exploration diversity through the identical entropy-collapse mechanism, converging on a few reward-maximizing strategies, while SFT on diverse demonstrations preserves breadth — evidence that the culprit is the RL objective's dynamics, not the reasoning domain Does reinforcement learning squeeze exploration diversity in search agents?. And the collapse you see during training is only half the story: training-time entropy collapse and test-time variance inflation are dual failures of exploration that need structurally different fixes, so taming regularization dominance during training won't automatically stabilize behavior at inference Why do reasoning models fail differently at training versus inference?.
The thing worth walking away with: entropy collapse is often framed as the model 'over-exploiting,' but the sharper diagnosis is that it's the *absence* of a competing signal. When reward variance dries up, regularization doesn't have to win an argument — it wins by default, and the visible symptom is a policy that quietly stops thinking.
Sources 5 notes
When within-prompt reward variance is low, task gradients weaken and regularization dominates, pushing policies toward generic outputs. SNR-Aware Filtering—selecting high-variance prompts before updates—recovers performance across tasks and scales.
Empirical law R = -a·exp(H) + b shows performance saturates when policy entropy approaches zero. Interventions like Clip-Cov, KL-Cov, and GPPO preserve exploratory capacity by managing entropy reduction during training.
Only ~20% of tokens exhibit high entropy as pivotal reasoning decision points; RLVR primarily adjusts these forking tokens. Training exclusively on them matches or exceeds full-gradient performance, revealing that the minority carries the learning signal.
RL training compresses behavioral diversity in search agents through the same entropy collapse mechanism documented in reasoning—policies converge on narrow reward-maximizing strategies. SFT on diverse demonstrations preserves exploration breadth, suggesting diversity-preservation techniques are essential for RL search scaling.
Both failures stem from failed exploration-exploitation balance but occur at different timescales requiring structurally distinct interventions. Training-time fixes (entropy bonuses, critique diversity) cannot prevent inference-time variance inflation, and vice versa; both loops must be managed independently.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- RAGEN-2: Reasoning Collapse in Agentic RL
- From Trial-and-Error to Improvement: A Systematic Analysis of LLM Exploration Mechanisms in RLVR
- The Invisible Leash: Why RLVR May Not Escape Its Origin
- The Entropy Mechanism of Reinforcement Learning for Reasoning Language Models
- Does Thinking More always Help? Understanding Test-Time Scaling in Reasoning Models
- Do Theory of Mind Benchmarks Need Explicit Human-like Reasoning in Language Models?
- Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning
- Local Coherence or Global Validity? Investigating RLVR Traces in Math Domains