ResOPD: Tail Residualization for Sparse On-Policy Distillation
cs.LG, cs.AI
Submitted: 2026-10-04
Updated: 2026-10-04
Comments: 25 pages, 9 figures
Code: https://github.com/InternLM/ResOPD
License: http://creativecommons.org/licenses/by/4.0/
The gist: On-policy distillation (OPD) trains a student model on self-generated trajectories, but transmitting dense teacher distributions across long reasoning traces creates prohibitive communication and
Terminology
Abstract
On-policy distillation (OPD) trains a student model on self-generated trajectories, but transmitting dense teacher distributions across long reasoning traces creates prohibitive communication and memory bottlenecks. Practical systems therefore rely on sparse teacher interfaces, typically transmitting either the sampled-token score or a small Top- k distribution. However, this sparse setting faces a fundamental dilemma: sampled-token estimators are unbiased but suffer from severe gradient variance, whereas directly optimizing Top- k objectives introduces systematic bias. To improve this trade-off, we propose ResOPD (On-Policy Distillation with Tail Residualization), which provides unbiased full-vocabulary reverse KL gradient estimation under on-policy sampling, with substantial variance reduction under the same sparse payload in the evaluated settings. ResOPD aggregates the unobserved vocabulary into an observable coarse tail event, computes its exact aggregate gradient, and samples only the fine-grained within-tail residual, which requires no additional teacher queries or forward passes. Extensive experiments demonstrate that ResOPD substantially reduces gradient variance, stabilizes online training dynamics, and improves downstream performance across the evaluated settings. These results establish ResOPD as an efficient, plug-and-play variance reduction primitive for sparse on-policy distillation.
Sources
- OpenCodeReasoning: Advancing Data Distillation for Competitive Coding
- Training Verifiers to Solve Math Word Problems
- Beyond Benchmarks: MathArena as an Evaluation Platform for Mathematics with LLMs
- MegaScience: Pushing the Frontiers of Post-Training Datasets for Science Reasoning
- Revisiting On-Policy Distillation: Empirical Failure Modes and Simple Fixes
- DeepMath-103K: A Large-Scale, Challenging, Decontaminated, and Verifiable Mathematical Dataset for Advancing Reasoning
- On-Policy Delta Distillation
- Reinforcement Learning via Self-Distillation
- Entropy-Aware On-Policy Distillation of Language Models
- DistiLLM: Towards Streamlined Distillation for Large Language Models
- AIMO-2 Winning Solution: Building State-of-the-Art Mathematical Reasoning Models with OpenMathReasoning dataset
- KL for a KL: On-Policy Distillation with Control Variate Baseline
- GPQA: A Graduate-Level Google-Proof Q&A Benchmark
- Challenging the Boundaries of Reasoning: An Olympiad-Level Math Benchmark for Large Language Models
- DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence
- Qwen3 Technical Report
- GLM-5: from Vibe Coding to Agentic Engineering
- EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL
- The Many Faces of On-Policy Distillation: Pitfalls, Mechanisms, and Fixes
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