SYNTHESIS NOTE
Topics›Reward Models›this note

Does outcome-based RL diversity loss spread across unsolved problems?

When RL concentrates probability mass on correct answers for solved problems, does that narrowing propagate to problems the model cannot yet solve? And if so, what are the separate mechanisms for preserving diversity during training versus at test time?

Synthesis note · 2026-02-22 · sourced from Reward Models

Outcome-based RL (rewarding only final answer correctness) produces substantial accuracy gains but systematically reduces generation diversity. This is known. What is new: the diversity loss transfers across problems. Concentrating probability mass on correct answers for solved problems propagates to unsolved problems — the model's entire output distribution narrows, not just its distribution on problems it can solve.

The transfer mechanism: RL sharpens the policy globally, not per-problem. When the model learns to concentrate on correct trajectories for problems it has solved, the reduced diversity in its generative distribution also manifests as reduced diversity on problems it has not solved. This means RL can reduce effective diversity even on the training set relative to the base model.

The practical consequence: diversity is critical for test-time scaling. Since Why does parallel reasoning outperform single chain thinking?, diverse parallel samples are more valuable than many copies of similar reasoning. And since Why does majority voting outperform more complex inference methods?, voting requires genuine diversity to work — voting over near-identical samples provides no signal.

The key conceptual contribution is distinguishing two forms of exploration:

These require different mechanisms. Historical exploration uses UCB-style bonuses over outcome space (tractable because reasoning tasks have a limited set of distinct final answers). Batch exploration uses within-batch repetition penalties. The distinction directly instantiates Why do reasoning models fail differently at training versus inference? — historical/batch exploration maps onto training-time/test-time with concrete algorithmic prescriptions.

Inquiring lines that read this note 52

This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.

How does policy entropy collapse limit scaling of reasoning-focused reinforcement learning? What limits recursive self-improvement in autonomous AI systems? How does diversity prevent model convergence on superficial patterns? Can readers reliably distinguish AI-written text from human writing? How do reward signal properties affect model reasoning and safety? How do training data quality and composition affect downstream model performance? Can latent reasoning match or exceed explicit reasoning performance? How effectively can test-time voting aggregate diverse reasoning samples? Does reinforcement learning create genuinely new reasoning capabilities or only refine existing ones? Why do LLM research ideation systems generate novelty but lack diversity? How do curriculum design and feedback approaches affect model learning? Does preference optimization undermine conversational grounding in language models? Which reinforcement learning modifications most improve dialogue quality in language models? What makes process supervision effective for training complex reasoning models? Can inference-time computation adaptively substitute for static model capacity? What limits language model accuracy in evaluating ideas? Can smaller specialized models match frontier models on key metrics? Can external verification systems adequately replace learned reasoning in AI outputs? What gaps exist between benchmark performance and real deployment outcomes?

Related concepts in this collection 6

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
18 direct connections · 174 in 2-hop network ·dense cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

Original note title

outcome-based rl induces diversity loss that transfers from solved to unsolved problems — historical and batch exploration require separate mechanisms