Study finds RL for reasoning changes only a few tokens, and you can copy the effect

A new analysis of reinforcement learning for LLM reasoning suggests the field's biggest gains come from a surprisingly small change. RL is not rewriting how models think. It is nudging a tiny slice of the output. What the researchers measured Across several model families and common methods like GRPO and PPO, reinforcement learning reranks only 1.0 to 4.1 percent of tokens. The token it promotes is almost always already one of the base model's top five choices. Training, in other words, pushe

1 min
Study finds RL for reasoning changes only a few tokens, and you can copy the effect

A new analysis of reinforcement learning for LLM reasoning suggests the field's biggest gains come from a surprisingly small change. RL is not rewriting how models think. It is nudging a tiny slice of the output.

What the researchers measured

Across several model families and common methods like GRPO and PPO, reinforcement learning reranks only 1.0 to 4.1 percent of tokens. The token it promotes is almost always already one of the base model's top five choices. Training, in other words, pushes the model toward a branch it was already considering rather than teaching it something new.

Where the change happens

The effect is concentrated at high-uncertainty decision points, the moments where the model is unsure which path to take. Correcting only those few positions recovers a large fraction of RL's accuracy gain. Random corrections at other positions do nothing. Crucially, the base model's own uncertainty already flags those spots, with no RL-trained model required.

Copying the effect without the training

The team built a method called REASONMAXXER that targets those positions directly and matches RL-level reasoning improvement without running the expensive RL optimization loop. The claim is that most of the benefit can be reproduced at far lower compute.

Why it matters

If the result holds across more models and tasks, a chunk of reasoning training could be replaced by a cheap, targeted edit instead of a long, costly RL run. That would reshape how labs budget for reasoning work and which models get the treatment. The open question is whether the shortcut generalizes or only works on the benchmarks tested so far.

Sources

- Rethinking RL for LLM Reasoning (arXiv:2605.06241) via AlphaXiv - https://www.alphaxiv.org/abs/2605.06241 - Original paper: https://arxiv.org/abs/2605.06241

Written by

More to read

  • Discrete Diffusion in Large Language Models: How Continuous-Time Markov Chains, Absorbing States, and Score Entropy Challenge Autoregressive Generation

    The dominance of autoregressive architectures in large language models rests on a fundamental mathematical formulation: the chain rule of probability. By factoring the joint distribution of a sequence into a product of conditional probabilities, $p(x) = \prod_{i=1}^N p(x_i \mid x_{<i})$, autoregressive models reduce text generation to sequential next-token prediction. While this left-to-right causal factorization has scaled effectively across compute regimes, it imposes rigid operational constr

    1 min
  • AI Agents Surpass Humans on OpenRouter as Agentic Token Usage Jumps 14x

    Autonomous AI agents have overtaken human users as the primary consumers of language model compute on OpenRouter, with agentic token volume surging fourteenfold over the past six months. Data published by OpenRouter analyst Peter Walker indicates that February 6 marked the permanent inflection point where token consumption by automated agents exceeded direct human API traffic. Since that threshold, agentic token volume on the multi-model gateway has climbed from 0.51 trillion to 7.3 trillion to

    1 min
  • Continuous Pre-Training in Production: Domain Adaptation, Replay Buffers, Learning Rate Restarts, and Catastrophic Forgetting Mitigation

    Continuous Pre-Training in Production: Domain Adaptation, Replay Buffers, Learning Rate Restarts, and Catastrophic Forgetting Mitigation Adapting general-purpose foundation models to specialized enterprise domains (such as clinical medicine, corporate law, quantitative finance, and proprietary software codebases) presents a fundamental architectural challenge. While Retrieval-Augmented Generation (RAG) and Supervised Fine-Tuning (SFT) remain standard first-line approaches, both exhibit severe s

    1 min