mlsanityData to 7 Oct 2026

Preference-Based Self-Distillation: Beyond KL Matching via Reward Regularization

arXiv 2605.05040 ↗First posted 6 May 2026cs.LG cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

On-policy distillation is an efficient alternative to reinforcement learning, offering dense token-level training signals. However, its reliance on a stronger external teacher has driven recent work on on-policy self-distillation, where the same model serves as both teacher and student under different prompt contexts. Yet, existing self-distillation methods largely reduce learning to KL matching toward the context-augmented teacher model. This approach often suffers from training instability and can degrade reasoning performance over time. Moreover, self-distillation from the same model with prompt augmentation lacks the exploratory diversity provided by a genuine external teacher. To address these limitations, we move beyond fixed-teacher KL matching and propose Preference-Based Self-Distillation (PBSD), which revisits on-policy self-distillation through a reward-regularized perspective. Instead of directly matching the teacher distribution, we derive a reward-regularized objective whose analytic optimum is a reward-reweighted teacher distribution, yielding a target policy provably superior to the original teacher under this objective. Practically, PBSD optimizes preference gaps between teacher and student samples while maintaining on-policy student sampling. We support this framework with a statistical analysis of the induced preference-learning problem, formally establishing when on policy self-distillation is preferable to learning from an external teacher in our setting. Experiments on mathematical reasoning and tool-use benchmarks across multiple model scales demonstrate that PBSD consistently achieves the strongest average performance among comparable baselines, showing improved training stability over prior self-distillation baselines while preserving token efficiency.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 31 of its 37 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

31 of 37 references.

References · 31

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  2. 2025Qwen3 Technical Reportcited by 8,195
  3. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  4. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
  5. 2023On-Policy Distillation of Language Models: Learning from Self-Generated Mistakescited by 840
  6. 2026Self-Distilled Reasoner: On-Policy Self-Distillation for Large Language Modelscited by 386
  7. 2025OpenThoughts: Data Recipes for Reasoning Modelscited by 287
  8. 2026Reinforcement Learning via Self-Distillationcited by 285
  9. 2026Rethinking On-Policy Distillation of Large Language Models: Phenomenology, Mechanism, and Recipecited by 262
  10. 2023Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise Comparisonscited by 244
  11. 2024Iterative Reasoning Preference Optimizationcited by 244
  12. 2026Self-Distillation Enables Continual Learningcited by 212
19 more
  1. 2026A Survey of On-Policy Distillation for Large Language Modelscited by 148
  2. 2026Revisiting On-Policy Distillation: Empirical Failure Modes and Simple Fixescited by 122
  3. 2026Self-Distilled RLVRcited by 109
  4. 2026Why Does Self-Distillation (Sometimes) Degrade the Reasoning Capability of LLMs?cited by 87
  5. 2026OpenClaw-RL: Train Any Agent Simply by Talkingcited by 83
  6. 2026Skill-SD: Skill-Conditioned Self-Distillation for Multi-turn LLM Agentscited by 75
  7. 2026Unifying Group-Relative and Self-Distillation Policy Optimization via Sample Routingcited by 65
  8. 2024Iterative Data Smoothing: Mitigating Reward Overfitting and Overoptimization in RLHFcited by 57
  9. 2026HDPO: Hybrid Distillation Policy Optimization via Privileged Self-Distillationcited by 39
  10. 2024Online DPO: Online Direct Preference Optimization with Fast-Slow Chasingcited by 38
  11. 2025Enhancing LLM Reasoning with Iterative DPO: A Comprehensive Empirical Investigationcited by 36
  12. 2026Embarrassingly Simple Self-Distillation Improves Code Generationcited by 36
  13. 2024The Crucial Role of Samplers in Online Direct Preference Optimizationcited by 26
  14. 2025Each Rank Could be an Expert: Single-Ranked Mixture of Experts LoRA for Multi-Task Learningcited by 12
  15. 2025AltLoRA: Towards Better Gradient Approximation in Low-Rank Adaptation with Alternating Projectionscited by 8
  16. 2025Towards Better Optimization For Listwise Preference in Diffusion Modelscited by 7
  17. 2026OneSearch-V2: The Latent Reasoning Enhanced Self-distillation Generative Search Frameworkcited by 6
  18. 2026EXACT: Explicit Attribute-Guided Decoding-Time Personalizationcited by 3
  19. 2026On-Policy Distillation of Language Models for Autonomous Vehicle Motion Planningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 10.

10 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Matching Supervision to the Student's Learning Capacity: A Unified Framework for On-Policy Self-Distillation
  2. 2026Learning beyond Teacher: Generalized On-Policy Distillation with Reward Extrapolation
  3. 2026Unmasking On-Policy Distillation: Where It Helps, Where It Hurts, and Why
  4. 2026SIPO: Unifying Reinforcement Learning with On-Policy Self-Distillation
  5. 2026Distill Skills into Weights, Not Prompts: Abstract Skills as Privileged Signals for On-Policy Self-Distillation
  6. 2026Reward-Aligned Reweighting for On-Policy Distillation
  7. 2026The Many Faces of On-Policy Distillation: Pitfalls, Mechanisms, and Fixes
  8. 2026On-Policy Delta Distillation