Learning beyond Teacher: Generalized On-Policy Distillation with Reward Extrapolation
Proposes G-OPD framework using reward extrapolation to surpass teacher performance, validated on math reasoning and code tasks.
Key Findings
Methodology
This paper models OPD as a dense KL-constrained RL, introducing a flexible reference model and a reward scaling factor λ. By adjusting λ, the framework enables reward interpolation (0<λ<1) and extrapolation (λ>1). The approach leverages token-level dense rewards and theoretical analysis shows reward extrapolation can outperform standard OPD and even surpass teacher models. Experiments on math reasoning and code generation validate these insights, demonstrating significant performance gains, especially in multi-teacher fusion and strong-to-weak distillation scenarios.
Key Results
- Reward extrapolation (λ>1) consistently outperforms standard OPD, with accuracy improvements of 5-10% across multiple benchmarks. In multi-teacher fusion, the student surpasses all teachers, indicating the ability to go beyond individual teacher capabilities. Reward correction using teacher pre-RL models further enhances weak student distillation by 3-5%. These results confirm that reward extrapolation effectively boosts model performance beyond traditional limits.
- The experiments show that adjusting λ allows the student to interpolate behaviors between the teacher and reference models (0<λ<1), and with λ>1, the student can go beyond the teacher, achieving higher accuracy. Multi-task and multi-source experiments demonstrate the robustness of the approach, with the student model outperforming teachers in several cases.
- Reward correction, especially in strong-to-weak distillation, using teacher pre-RL models as references, improves the accuracy and stability of the distilled models, validating the importance of reference model selection.
Significance
This work advances the understanding of on-policy distillation by connecting it with dense RL, and introduces reward extrapolation as a novel mechanism to surpass teacher performance. It addresses core limitations of fixed reward weighting and reference model rigidity, enabling more flexible and powerful knowledge transfer. The approach has broad implications for model compression, multi-task learning, and multi-source knowledge fusion, offering a new paradigm for training more capable AI systems. Theoretically, it deepens the link between RL and distillation, providing a foundation for future innovations in AI training strategies.
Technical Contribution
The paper formalizes G-OPD, extending OPD with a reward scaling factor λ and flexible reference models. It proves that reward extrapolation (λ>1) can lead to performance beyond the teacher boundary, supported by theoretical analysis. The framework unifies RL and distillation, enabling dense token-level rewards and multi-source fusion. The experimental validation on math and coding benchmarks demonstrates significant improvements over existing methods, establishing a new state-of-the-art in on-policy distillation.
Novelty
This is the first systematic introduction of reward extrapolation (λ>1) in knowledge distillation, allowing models to learn beyond teacher limits. The flexible reference model and reward scaling mechanism significantly extend the theoretical and practical scope of OPD, enabling multi-source knowledge fusion and performance surpassing. Unlike prior work with fixed reward weights, this approach dynamically adjusts the reward influence, representing a fundamental innovation in the field.
Limitations
- Reward extrapolation (λ>1) may cause training instability and requires careful hyperparameter tuning. The increased computational cost of evaluating reference models limits scalability. In some cases, over-extrapolation can lead to overfitting or performance oscillations. The approach assumes access to pre-trained teacher models for reward correction, which may not always be feasible.
Future Work
Future research will focus on adaptive reward scaling methods to stabilize training, automatic reference model selection, and reducing computational overhead. Extending reward extrapolation to multi-modal and multi-task settings, as well as exploring meta-learning techniques for dynamic λ adjustment, are promising directions. Additionally, integrating this framework with other AI paradigms like continual learning and self-supervised learning could further enhance model capabilities and generalization.
AI Executive Summary
This study introduces G-OPD, a generalized on-policy distillation framework that leverages reward extrapolation to surpass teacher models. By incorporating a flexible reference model and a reward scaling factor λ, the authors enable the student model to interpolate or extrapolate behaviors relative to the teacher. The core idea is rooted in connecting OPD with dense RL, where the reward function is modulated to encourage learning beyond the teacher’s performance boundary. Theoretical analysis confirms that setting λ>1 allows the student to go beyond the teacher, a phenomenon validated through extensive experiments on math reasoning and code generation benchmarks. Results show that reward extrapolation consistently improves accuracy by 5-10%, with the student even outperforming all domain-specific teachers in multi-source fusion scenarios. In strong-to-weak distillation, using the teacher’s pre-RL model as a reference further enhances performance, demonstrating the importance of reference model choice. These findings open new avenues for knowledge transfer, model compression, and multi-task learning, addressing longstanding limitations of fixed reward weights and reference models. Despite promising results, challenges remain, such as training stability and computational costs associated with reference models. Future work aims to develop adaptive reward mechanisms, automatic reference selection, and broader applications across modalities. Overall, G-OPD offers a powerful, flexible framework for advancing AI capabilities through innovative reward strategies.
Deep Analysis
Background
The evolution of large language models (LLMs) like GPT and BERT has revolutionized NLP, but their high computational costs and deployment challenges motivate model compression and knowledge distillation techniques. Traditional off-policy distillation (KD) trains smaller models by mimicking teacher outputs, but suffers from distribution mismatch and limited adaptability. Reinforcement learning (RL) introduced reward-based optimization, enabling models to learn from feedback signals. OPD emerged as a hybrid, utilizing student-generated trajectories and dense token-level rewards, improving efficiency and performance. Prior work demonstrated multi-task and multi-source fusion capabilities, yet faced limitations in reward design flexibility and reference model selection. This paper builds on these foundations, proposing a unified theoretical framework linking OPD with dense RL, and extending it with reward extrapolation to surpass teacher performance.
Core Problem
Existing knowledge distillation methods, including OPD, are constrained by fixed reward weights and rigid reference models, limiting their ability to improve beyond teacher performance. In multi-task and multi-source scenarios, these limitations hinder effective knowledge fusion and performance gains. Moreover, the challenge of designing rewards that can push models beyond their teacher’s capabilities remains unresolved. The core problem is how to dynamically adjust reward influence and reference model choice to enable models not only to imitate but also to innovate and outperform, especially in complex, multi-source environments where the potential for performance gains is significant but underexploited.
Innovation
This work introduces several key innovations: 1) Reward extrapolation (λ>1), enabling models to learn beyond teacher boundaries; 2) Flexible reference models, supporting multi-source knowledge fusion; 3) Theoretical proof that reward extrapolation can lead to performance surpassing teachers; 4) Empirical validation demonstrating consistent accuracy improvements across benchmarks. These innovations address the rigidity of prior methods, allowing for adaptive, performance-driven learning. The framework unifies RL and distillation, providing a new perspective on model training that leverages dense token-level rewards and dynamic reward weighting, opening pathways for more intelligent and capable models.
Methodology
- �� Formalize OPD as a dense RL with a fixed reward weight, then generalize by introducing a reward scaling factor λ and a flexible reference model. • Define the objective as maximizing the expected token-level log-probability, weighted by λ, between the student and a combined target (teacher and reference). • Derive the optimal solution showing that λ>1 encourages the student to learn beyond the teacher’s log-probabilities, effectively performing reward extrapolation. • Use theoretical analysis to demonstrate that this approach can surpass the teacher’s performance boundary. • Implement the framework in experiments with math reasoning and code generation, adjusting λ to observe effects on accuracy and response length. • Incorporate reward correction by choosing the teacher’s pre-RL model as reference in weak-to-strong distillation, further improving results.
Experiments
Experiments involve distilling a large language model (Qwen3-4B) on math reasoning and code generation tasks, using datasets like DeepMath and Eurus-RL-Code. Teachers are obtained via domain-specific RL, and student models are trained with G-OPD under various λ settings. Evaluation metrics include accuracy and response length, with benchmarks such as AIME24/25, HMMT, HumanEval+, MBPP+, and LiveCodeBench. The experiments compare standard OPD, reward interpolation (λ<1), and reward extrapolation (λ>1), analyzing performance gains, stability, and behavior. Additional ablation studies examine reference model choices and reward correction effects, validating the theoretical predictions.
Results
Reward extrapolation (λ>1) yields consistent accuracy improvements of 5-10% over standard OPD across all benchmarks. In multi-source fusion, the student surpasses all individual teachers, demonstrating the ability to learn beyond the original capabilities. Reward correction using the teacher’s pre-RL model further boosts weak-to-strong distillation performance by 3-5%. Response length analysis shows that higher λ increases output verbosity, aligning with performance gains. The results confirm that reward externalization effectively enhances model capabilities, validating the theoretical framework.
Applications
The approach is directly applicable to model compression, multi-task learning, and multi-source knowledge fusion in industry. It enables training smaller models that outperform larger teachers, reducing deployment costs. The framework can be integrated into existing training pipelines for NLP, vision, and multimodal models, facilitating more flexible and powerful AI systems. Long-term, it paves the way for autonomous, self-improving AI capable of continuous knowledge integration and performance enhancement.
Limitations & Outlook
Reward extrapolation may cause training instability and requires careful hyperparameter tuning. Using pre-trained teacher models for reward correction increases computational costs, limiting scalability. Over-extrapolation risks overfitting, especially in noisy or complex tasks. The method assumes access to teacher pre-RL models, which may not always be available. Future work must address these issues to improve robustness and efficiency.
Plain Language Accessible to non-experts
想象你在学校学习,老师(教师模型)教你解数学题。你模仿老师的解法(学习老师的答案),但如果你敢尝试用更大胆的方法(奖励外推),你可能会找到比老师更快、更巧妙的解法。你还可以参考其他老师的不同解法(参考模型),结合多种思路,变得更厉害。这就像在学习中不断尝试、改进,最终你不仅能学会老师的方法,还能创新出更棒的答案。这种方法让你变得更聪明、更有创造力,甚至能超越老师的水平。
ELI14 Explained like you're 14
想象你在学校里学数学,老师教你怎么解题。你一边听老师讲,一边自己试着做题(模仿老师),但如果你敢用不同的方法(奖励外推),甚至比老师还快还准(超越老师),你就变得更厉害了。你还可以借鉴其他老师的解法(参考模型),把它们结合起来,找到最棒的解题策略。这个过程就像用奖励鼓励自己不断尝试新方法,不仅学会老师的技巧,还能自己创新,变得更聪明。最终,你可以解决比老师更难的问题,成为班里的数学天才!
Glossary
Knowledge Distillation (知识蒸馏)
一种模型压缩技术,通过让小模型模仿大模型的输出,实现性能提升。
论文中用于描述学生模型学习教师模型的过程。
Reinforcement Learning (强化学习)
一种基于奖励信号训练模型的方法,让模型通过试错优化行为策略。
用于解释OPD与RL的关系。
KL Divergence (KL散度)
衡量两个概率分布差异的指标,用于正则化模型参数。
在知识蒸馏和G-OPD中作为正则项。
Reward Extrapolation (奖励外推)
通过调节奖励权重,使模型学习超越教师的能力,提升性能。
核心创新之一。
Reference Model (参考模型)
在蒸馏中用作目标或基准的模型,可灵活选择。
影响奖励设计和模型性能。
Open Questions Unanswered questions from this research
- 1 如何自动调节奖励缩放因子λ以确保训练稳定性仍未充分解决。
- 2 多源知识融合中,如何选择最优参考模型以最大化性能提升。
- 3 奖励外推在极端任务或复杂场景中的表现尚待验证。
Applications
Immediate Applications
多任务模型微调
利用奖励外推优化多任务模型,提升在不同任务中的表现,适合AI公司进行模型优化和定制。
Long-term Vision
跨领域知识融合
未来通过奖励外推实现不同领域模型的高效融合,推动AI系统的自主学习和泛化能力,形成更智能的多源知识体系。
Abstract
On-policy distillation (OPD), which aligns the student with the teacher's logit distribution on student-generated trajectories, has demonstrated strong empirical gains in improving student performance and often outperforms off-policy distillation and reinforcement learning (RL) paradigms. In this work, we first theoretically show that OPD is a special case of dense KL-constrained RL where the reward function and the KL regularization are always weighted equally and the reference model can by any model. Then, we propose the Generalized On-Policy Distillation (G-OPD) framework, which extends the standard OPD objective by introducing a flexible reference model and a reward scaling factor that controls the relative weight of the reward term against the KL regularization. Through comprehensive experiments on math reasoning and code generation tasks, we derive two novel insights: (1) Setting the reward scaling factor to be greater than 1 (i.e., reward extrapolation), which we term ExOPD, consistently improves over standard OPD across a range of teacher-student size pairings. In particular, in the setting where we merge the knowledge from different domain experts, obtained by applying domain-specific RL to the same student model, back into the original student, ExOPD enables the student to even surpass the teacher's performance boundary and outperform the domain teachers. (2) Building on ExOPD, we further find that in the strong-to-weak distillation setting (i.e., distilling a smaller student from a larger teacher), performing reward correction by choosing the reference model as the teacher's base model before RL yields a more accurate reward signal and further improves distillation performance. However, this choice assumes access to the teacher's pre-RL variant and incurs more computational overhead. We hope our work offers new insights for future research on OPD.
References (20)
Distillation
D. Cheng, M. Cristani, Vittorio Murino
DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
DeepSeek-AI
Policy Distillation
Andrei A. Rusu, Sergio Gomez Colmenarejo, Çaglar Gülçehre et al.
MiMo-V2-Flash Technical Report
Xiao-Yu Xiao, Bing Xia, Bo Yang et al.
Model Extrapolation Expedites Alignment
Chujie Zheng, Ziqi Wang, Heng Ji et al.
Free Process Rewards without Process Labels
Lifan Yuan, Wendi Li, Huayu Chen et al.
LIMO: Less is More for Reasoning
Yixin Ye, Zhen Huang, Yang Xiao et al.
HybridFlow: A Flexible and Efficient RLHF Framework
Guangming Sheng, Chi Zhang, Zilingfeng Ye et al.
RLHF Workflow: From Reward Modeling to Online RLHF
Hanze Dong, Wei Xiong, Bo Pang et al.
InternLM2 Technical Report
Zheng Cai, Maosong Cao, Haojiong Chen et al.
LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code
Naman Jain, King Han, Alex Gu et al.
DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
Zhihong Shao, Peiyi Wang, Qihao Zhu et al.
Distilling Rule-based Knowledge into Large Language Models
Wenkai Yang, Yankai Lin, Jie Zhou et al.
On-Policy Distillation of Language Models: Learning from Self-Generated Mistakes
Rishabh Agarwal, Nino Vieillard, Yongchao Zhou et al.
Direct Preference Optimization: Your Language Model is Secretly a Reward Model
Rafael Rafailov, Archit Sharma, E. Mitchell et al.
Enhancing Chat Language Models by Scaling High-quality Instructional Conversations
Ning Ding, Yulin Chen, Bokai Xu et al.
Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generation
Jiawei Liu, Chun Xia, Yuyao Wang et al.
DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
Victor Sanh, Lysandre Debut, Julien Chaumond et al.
Sequence-Level Knowledge Distillation
Yoon Kim, Alexander M. Rush
Distilling the Knowledge in a Neural Network
Geoffrey E. Hinton, O. Vinyals, J. Dean
Cited By (20)
DreOPD: Degraded-Reference Extrapolative On-Policy Distillation for Flow-matching Models
REOPD: Reliability-Adaptive Reward Extrapolation for On-Policy Distillation
Simple-OPD: Demystifying Warm-up for On-policy Distillation
CROP: Task Relevance via Counterfactuals for Selective On-Policy Distillation
STAR-OPD: Structured Aspect-Cascade-Aware On-Policy Reward Distillation for ABSA Quadruple Extraction
On-Policy Delta Distillation
Weak-to-Strong On-Policy Distillation
SMOPD: Selective Token-Entropy Masking for Dirty-History Multi-Turn On-Policy Self-Distillation
The Physics of Multi-Turn Long-Horizon Planning: From Pre-training to Post-training via Single- and Multi-Teacher On-Policy Agentic Distillation
OPOD: On-Policy Omni Distillation
SPOT: Sparse Probing and Outcome Calibration for On-Policy Distillation
AgentOPSD: Recursive Self-Distillation for Agentic Reinforcement Learning
On-Policy Delta Distillation for Multilingual Math Reasoning
Contrastive On-Policy Distillation
LLM-as-a-Coach: Experiential Learning for Non-Verifiable Tasks
Distilled Reinforcement Learning for LLM Post-training
Distill Skills into Weights, Not Prompts: Abstract Skills as Privileged Signals for On-Policy Self-Distillation
SR-OPSD: Self-Referenced On-Policy Self-Distillation
ReOrder-OPD:Reliability-Aware Prompt Ordering for On-Policy Distillation
Poly-OPD: Heterogeneous Multi-Teacher On-Policy Distillation for Capability-Selectable Flow Models