Paper: RL for LLM Reasoning is Sparse Policy Selection, Not Capability Learning

mark_k · x · 2026-08-16

A new paper analyzes reinforcement learning (RL) for LLM reasoning and finds that it does not teach new strategies; instead, it merely redistributes probability over solutions the base model already contains. The beneficial edits are sparse (1–3% of tokens), concentrated at high-entropy decision points, and almost always promote tokens already in the base model’s top-5.

Building on this, the authors introduce ReasonMaxxer, an RL-free method that applies contrastive loss only at those entropy-gated spots. It requires only a few hundred rollouts, tens of problems, and minutes on a single GPU. Despite costing 1000× less, ReasonMaxxer matches or beats full RL across models and math benchmarks, reframing the problem as sparse policy selection rather than capability acquisition.

Related event: Paper: RL Teaches LLMs No New Strategies, Gains Reproduced at 1/1000th Compute(4 posts)→

Original post →

More from Research

Research channel →