INQUIRING LINE

When an AI is trained purely on rewards, it eventually becomes so certain of its approach that it stops discovering better ones.

How does policy entropy collapse constrain zero RL scaling for reasoning?

This explores why reasoning models trained with pure RL (no supervised warm-up — 'zero RL') hit a performance ceiling, and how the shrinking diversity of the model's outputs during training is the mechanism behind that ceiling.


This explores why reasoning models trained with pure RL keep improving for a while and then flatten out — and the corpus points to a single culprit with a surprisingly clean signature. As RL rewards the model for correct answers, the policy becomes more and more confident, its entropy falls, and exploration dries up. One line of work makes this almost quantitative: performance follows the law R = -a·exp(H) + b, so once entropy H approaches zero, reward saturates and no amount of extra compute buys more reasoning Does policy entropy collapse limit reasoning performance in RL?. Entropy collapse isn't a side effect of scaling — it *is* the ceiling.

The mechanism generalizes beyond math reasoning. The same convergence-onto-a-narrow-strategy shows up in search agents, where RL compresses behavioral diversity exactly as it does in reasoning, and where training on diverse demonstrations (SFT) is what preserves the breadth RL erodes Does reinforcement learning squeeze exploration diversity in search agents?. There's also a finer-grained account of *why* the policy narrows: when the reward has little variance within a prompt — every rollout scores about the same — the useful gradient vanishes and regularization quietly pushes the model toward generic, input-agnostic templates. Filtering for high-variance prompts before each update recovers the lost performance Why do language models collapse into generic templates?. So collapse can come both from over-confidence (entropy → 0) and from the reward signal going flat.

Why does this cap reasoning specifically? Because of what zero RL is actually doing. Evidence suggests RL post-training mostly teaches a base model *when* to deploy reasoning it already latently has, not *how* to reason in new ways — hybrid models recover ~91% of the gains just by routing tokens, and the activation directions for reasoning strategies exist before any RL Does RL post-training create reasoning or just deploy it?. If RL is selecting among pre-existing behaviors rather than inventing them, then collapsing the exploration distribution can only ever converge onto the best behavior the base model already contained — which is precisely a ceiling.

The interesting part is that the ceiling isn't uniform across training. RL reasoning tends to move through two phases: first the model nails execution correctness, then strategic planning becomes the bottleneck — and notably, planning-token entropy *rises* in the second phase even as execution entropy stabilizes Does RL training follow a predictable two-phase learning sequence?. That suggests entropy collapse is most damaging when it hits the tokens where exploration still matters (the planning decisions), which is why blanket entropy management can be blunt. It also hints that scale interacts with collapse: on social reasoning, larger models develop genuine belief-tracking under RL while smaller ones collapse into shortcut heuristics that hit the same accuracy without real reasoning Does reinforcement learning on theory of mind collapse with model scale?.

The corpus's escape routes all attack the information bottleneck rather than just clamping entropy. Targeted interventions like Clip-Cov, KL-Cov, and GPPO preserve exploratory capacity by controlling *how* entropy is spent Does policy entropy collapse limit reasoning performance in RL?. More radically, the ceiling may be a property of the reward *format*: scalar rewards carry no information about *why* an answer failed, and swapping in chain-of-thought critiques lets models generate correct solutions past a plateau where numerical rewards stall Can natural language feedback overcome numerical reward plateaus?. The takeaway a curious reader might not expect: entropy collapse isn't only a diversity problem you regularize away — it's a symptom that the reward signal has run out of things to teach, and the fix is often richer feedback, not more RL steps.


Sources 7 notes

Does policy entropy collapse limit reasoning performance in RL?

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.

Does reinforcement learning squeeze exploration diversity in search agents?

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.

Why do language models collapse into generic templates?

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.

Does RL post-training create reasoning or just deploy it?

Evidence shows base models already contain reasoning capability in latent form; RL training optimizes deployment timing rather than capability creation. Hybrid models recover 91% of performance gains by routing tokens only, and activation vectors for reasoning strategies pre-exist before any RL.

Does RL training follow a predictable two-phase learning sequence?

Across eight models, RL training consistently shows a first phase where execution correctness drives learning, followed by a second phase where strategic planning becomes the bottleneck. Planning token entropy increases while execution entropy stabilizes, and concentration of optimization on planning tokens yields significant performance gains.

Show all 7 sources
Does reinforcement learning on theory of mind collapse with model scale?

7B models develop explicit, transferable belief-tracking under RL, while smaller models achieve comparable accuracy through shortcut learning that lacks interpretable reasoning traces. The mismatch between accuracy and reasoning quality is invisible without inspecting step-by-step outputs.

Can natural language feedback overcome numerical reward plateaus?

Critique-GRPO shows that models stuck on performance plateaus can generate correct solutions when given chain-of-thought critiques, revealing that numerical rewards lack critical information about why failures occur and how to improve.

Papers this line draws on 8

The research behind the notes this line reads — ranked by how closely each paper relates.

Research prompt for your LLMexpand ↓

Copy into ChatGPT or Claude to take this line of inquiry further — it asks the model to find newer work and re-test which earlier constraints still hold.

You are an RL-for-reasoning analyst. Open question, still live: does policy entropy collapse fundamentally cap zero-RL scaling for reasoning, or is that ceiling an artifact of today's rewards and training?

What a curated library found — and when (dated claims, not current truth). These span a 2024–2026 range:
- Reward tracks entropy as R = -a·exp(H) + b; as H→0 reward saturates and extra compute buys no reasoning (~2025).
- RL may mostly select pre-existing behaviors: hybrid routing recovers ~91% of gains, so collapsing exploration can only converge on what the base model already held (~2025).
- Flat within-prompt reward variance kills the gradient and drifts models toward input-agnostic templates; filtering high-variance prompts recovers the lost performance (~2025).
- Training is two-phase — execution first, planning second — and planning-token entropy *rises* in phase two, so blanket entropy clamps hit the wrong tokens (~2025).
- Larger models grow real belief-tracking under RL while smaller ones collapse to shortcut heuristics at equal accuracy (~2024).

Anchor papers (verify; mind their dates): The Entropy Mechanism of RL for Reasoning (arXiv:2505.22617, 2025); RL with One Training Example (arXiv:2504.20571, 2025); Critique-GRPO (arXiv:2506.03106, 2025); Misleading Success of Simulating Social Intelligence (arXiv:2403.05020, 2024).

Your task:
(1) Re-test each constraint above: judge whether newer models, training methods, tooling, orchestration (memory, multi-agent), or evaluation have relaxed or overturned it. Separate the durable question (likely still open) from the perishable limitation; cite what resolved it, and say plainly where a constraint still appears to hold.
(2) This line surfaces a tension — foreground the disagreement: does entropy-preserving optimization (Clip-Cov, KL-Cov, GPPO) or richer feedback (CoT critiques, rubric anchors, diversity-trained policies) actually break the R=-a·exp(H)+b ceiling, and who argues collapse is *not* the true bottleneck? Pull the strongest contradicting/superseding work from the last ~6 months.
(3) Propose 2 research questions that assume the regime may have already moved.

Cite arXiv IDs; flag anything you cannot ground in a real paper.