[2605.06241] Rethinking RL for LLM Reasoning: It's Sparse Policy Selection, Not Capability Learning
Skip to main content
Search arXiv
Press Enter to search · Advanced search
-->
Computer Science > Computation and Language
arXiv:2605.06241 (cs)
[Submitted on 7 May 2026 (v1), last revised 8 May 2026 (this version, v2)]
Title:Rethinking RL for LLM Reasoning: It's Sparse Policy Selection, Not Capability Learning
Authors:Ömer Faruk Akgül, Rajgopal Kannan, Willie Neiswanger, Viktor Prasanna<br>View a PDF of the paper titled Rethinking RL for LLM Reasoning: It's Sparse Policy Selection, Not Capability Learning, by \"Omer Faruk Akg\"ul and 3 other authors
View PDF<br>HTML (experimental)
Abstract:Reinforcement learning has become the standard for improving reasoning in large language models, yet evidence increasingly suggests that RL does not teach new strategies; it redistributes probability mass over solutions the base model already contains. In this work, we ask: if RL merely steers the model toward paths it already knows, is the RL optimization loop itself necessary? Through token-level analysis across multiple model families and RL algorithms, we find that RL's beneficial footprint is a sparse, predictable correction concentrated at high-entropy decision points where the model is uncertain which branch to take. Only 1--3\% of token positions are affected, the promoted token always lies within the base model's top-5 alternatives, and targeted corrections at those few positions causally recover a large fraction of RL's accuracy gain, while random corrections fail. The base model's own entropy identifies these positions without any RL-trained model, and the entire correction is low-dimensional, representable in a tiny fraction of model parameters. These findings reframe reasoning improvement as sparse policy selection, not capability acquisition. We translate this insight into ReasonMaxxer, a minimal RL-free method that applies contrastive loss only at entropy-gated decision points, using a few hundred base-model rollouts and no online generation. Across three model families, six scales, and six math reasoning benchmarks, ReasonMaxxer matches or exceeds full RL performance while requiring only tens of problems and minutes of single-GPU training, a reduction in training cost of roughly three orders of magnitude.
Subjects:
Computation and Language (cs.CL)
Cite as:<br>arXiv:2605.06241 [cs.CL]
(or<br>arXiv:2605.06241v2 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2605.06241
Focus to learn more
arXiv-issued DOI via DataCite
Submission history<br>From: Ömer Faruk Akgül [view email]<br>[v1]<br>Thu, 7 May 2026 13:25:05 UTC (438 KB)
[v2]<br>Fri, 8 May 2026 19:48:19 UTC (438 KB)
Full-text links:<br>Access Paper:
View a PDF of the paper titled Rethinking RL for LLM Reasoning: It's Sparse Policy Selection, Not Capability Learning, by \"Omer Faruk Akg\"ul and 3 other authors<br>View PDF<br>HTML (experimental)<br>TeX Source
view license
Current browse context:
cs.CL
next >
new<br>recent<br>| 2026-05
Change to browse by:
cs
References & Citations
NASA ADS<br>Google Scholar
Semantic Scholar
export BibTeX citation<br>Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .
Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)
Major funding support from