When an AI learns from a checkable right answer versus grading its own work, what actually changes?
How does RLSVR differ from using model probability or self-judgment?
This explores how reinforcement learning driven by an outside, checkable reward (the RLVR family, since the corpus never defines "RLSVR" and I'm reading it that way) differs from letting the model score itself, either by its own judgment or by its own probabilities.
This explores how reinforcement learning driven by an outside, checkable reward (the RLVR family, since the corpus never defines "RLSVR" and I'm reading it that way) differs from letting the model score itself. The basic difference is where the training signal comes from. In RLVR it comes from outside the model, such as a check that the final answer matches. In self-judgment and internal-probability methods it comes from inside the model.
The inside camp is mapped in Can language models replace reward models with internal signals?. Late-2025 work independently landed on three patterns, each removing a piece of the classic RLHF pipeline. Pairwise self-judgment, where the model compares its own answers, replaces the reward model. Internal belief-shift, which tracks how much the model's own confidence moves, replaces the critic. Self-distillation from rich feedback replaces the explicit reward. All three come from the policy's own computations, so a separately trained reward classifier becomes optional. The appeal is that you don't need an answer key.
What the outside check buys is less clear than it sounds. RLVR mostly sharpens what the model can already do. Does RLVR actually expand what models can reason about? shows base models beating RLVR-trained ones when you sample many attempts, so training narrows sampling toward answers already in reach. What does reward learning actually do to model reasoning? adds that a single training example can trigger the gain. The signal also matters less than you'd expect. In Why do random rewards improve reasoning for some models but not others?, random rewards lift Qwen2.5-Math by 16-25% but do nothing for Llama or OLMo, because pretraining decides what the optimization can surface. Then Does RLVR success on math benchmarks reflect genuine reasoning improvement? finds that on clean benchmarks only correct rewards help, and that Qwen's earlier gains leaned on memorized test data. Can genuine reasoning activation coexist with contaminated benchmarks? explains how both can hold: behavior change and benchmark score are measured at different levels. So a verifiable reward has a real edge, but only if you measure on clean data.
The outside signal has its own failure modes, and they come from trusting a right/wrong label too literally. On nearly impossible problems, rare lucky successes get treated as high-value, which teaches shortcuts like repeating answers and skipping computation (Do overly hard RLVR samples actually harm model capabilities?). The on-policy setup can also shrink the model's problem-solving range by discouraging exploration (Why does RLVR training narrow a model's problem solving ability?). Model probability is a different kind of signal. Does setting temperature to zero actually make LLM outputs reliable? shows that one output is just one draw from a distribution, and that consistency isn't reliability. My inference is that a model's probability describes how it samples, not whether it is right, though that note doesn't test it as a training signal.
The corpus has no head-to-head comparison of verifiable rewards against self-judgment or confidence signals. It says what each approach is and how each fails, but not which one wins.
Sources 9 notes
Late-2025 RL literature independently converges on three patterns that replace different RLHF components: pairwise self-judgment replaces the reward model, internal belief-shift replaces the critic, and rich-feedback self-distillation replaces explicit reward signals. Each emerges from the policy's own computations, making the trained reward classifier optional.
Pass@k analysis shows base models outperform RLVR models at high k, indicating RLVR doesn't expand solvable problems but rather narrows sampling toward solutions already in the base model's distribution. Distillation, by contrast, genuinely transfers new reasoning patterns.
Research shows RLVR improves sampling efficiency within existing capability boundaries without expanding them. A single training example suffices for activation, and spurious rewards work nearly as well as correct ones for models with appropriate pretraining.
Qwen2.5-Math gains 16-25% MATH-500 improvement from random or incorrect rewards by activating latent code-reasoning behavior from pretraining, while Llama and OLMo show no gains. Pretraining format determines what optimization pressure can surface.
Qwen2.5-Math-7B reconstructs 54.6% of MATH-500 from partial prompts but scores 0.0% on post-release LiveMathBench, revealing dataset contamination. On clean benchmarks, only correct rewards improve performance; random and inverse rewards fail or degrade reasoning ability.
Show all 9 sources
RLVR activates genuine reasoning patterns through RL training while benchmark improvements may reflect data memorization on contaminated datasets. These operate at different measurement levels and can coexist without contradiction.
Training on nearly-impossible problems causes models to learn degenerate shortcuts rather than genuine reasoning, and these shortcuts contaminate pre-existing capabilities. Group-relative normalization treats rare accidental successes as high-advantage trajectories, reinforcing answer repetition and computation-skipping instead of sound reasoning patterns.
RLVR narrows models' problem-solving scope by prioritizing exploitation over exploration, a phenomenon called capability boundary collapse. Multiple importance sampling with exploration-based advantage functions can counteract this by integrating external data and explicitly rewarding discovery of underexplored but valuable reasoning paths.
Fixed seeds and zero temperature replicate the same output repeatedly, but that output remains one draw from the model's probability distribution. McDonald's omega testing across 100 repetitions reveals that consistency does not equal reliability.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- The Invisible Leash: Why RLVR May Not Escape Its Origin
- Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?
- Spurious Rewards: Rethinking Training Signals in RLVR
- Local Coherence or Global Validity? Investigating RLVR Traces in Math Domains
- RL-PLUS: Countering Capability Boundary Collapse of LLMs in Reinforcement Learning with Hybrid-policy Optimization
- From Trial-and-Error to Improvement: A Systematic Analysis of LLM Exploration Mechanisms in RLVR
- Absolute Zero: Reinforced Self-play Reasoning with Zero Data
- Reinforcement Learning for Reasoning in Large Language Models with One Training Example