Decoupling Exploration from Optimization in RLVR
cs.LG, cs.AI, cs.CL
Submitted: 2026-10-07
Updated: 2026-10-07
Comments: 20 pages, 16 figures, 9 tables. Code: https://github.com/SaifPunjwani/Exploration-Distillation. Checkpoints: https://huggingface.co/SaifPunjwani/expdis-checkpoints
License: http://creativecommons.org/licenses/by/4.0/
The gist: Modern language models undergo reinforcement learning with verifiable rewards (RLVR) on top of already-trained checkpoints.
Terminology
Abstract
Modern language models undergo reinforcement learning with verifiable rewards (RLVR) on top of already-trained checkpoints. A key promise of RLVR is the discovery of new reasoning strategies. In principle, a model can sample novel ideas absent from its prior training data. In practice, however, augmenting RLVR with strong novelty incentives has seen limited success and can degrade model quality. Because verifiable rewards supervise only a narrow slice of the model's knowledge and behavior, such degradations are difficult to recover from. Instead, we decouple exploration from optimization in a framework we call Exploration-Distillation (ExpDis). We train one or more explorer policies with a novelty bonus in the reward, filter their trajectories for correctness and quality, and distill them into a separate student policy. The student policy is then trained without a novelty bonus. We repeat the above procedure for several rounds, alternating between exploration and optimization. This decoupling allows us to aggressively scale exploration without degrading the student policy. Across seven mathematical reasoning benchmarks and two model families, ExpDis outperforms DAPO at the same wall-clock budget. Moreover, we observe improved pass@ k scaling, indicating that ExpDis produces models that generate more diverse correct solutions.
Sources
- Exploration by Random Network Distillation
- Evaluating Large Language Models Trained on Code
- Training Verifiers to Solve Math Word Problems
- The Entropy Mechanism of Reinforcement Learning for Reasoning Language Models
- Instruction-Conditioned Exploration for Reinforcement Learning with Self-Distillation to an Unconditioned Policy
- Diversity is All You Need: Learning Skills without a Reward Function
- Navigate the Unknown: Enhancing LLM Reasoning with Intrinsic Motivation Guided Exploration
- Reinforced Self-Training (ReST) for Language Modeling
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- Measuring Mathematical Problem Solving With the MATH Dataset
- Tulu 3: Pushing Frontiers in Open Language Model Post-Training
- Jointly Reinforcing Diversity and Quality in Language Model Generations
- Ministral 3
- MOPD: Multi-Teacher On-Policy Distillation for Capability Integration in LLM Post-Training
- When Can LLMs Learn to Reason with Weak Supervision?
- GPQA: A Graduate-Level Google-Proof Q&A Benchmark
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- Beyond Human Data: Scaling Self-Training for Problem-Solving with Language Models
- Outcome-based Exploration for LLM Reasoning
- R$^2$PO: Decoupling Rollout and Inference Policies for LLM Reasoning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks