mlsanityData to 14 Oct 2026

Off-Policy Merging Beats On-Policy Self-Distillation for Continual Learning

arXiv 2610.05872 ↗First posted 5 Oct 2026cs.LG cs.AI cs.CLcited by 0

On the map: Knowledge distillation → On-policy and self-distillation for LLMs

Abstract (arXiv)

A long-standing goal of AI is a model that can continually learn and improve itself. On post-trained models, supervised finetuning (SFT) on new data often causes poor generalization and catastrophic forgetting. As such, the conventional wisdom is that on-policy training is a prerequisite for continual learning. In practice, however, data containing new knowledge or capabilities are often off-policy. While methods such as on-policy self-distillation (OPSD) try to bridge this gap by converting off-policy data into on-policy signal, they have been shown to cause reasoning collapse. In this paper, we show that off-policy merging beats OPSD for continual learning. We first show that SFT learns a useful signal from new data, but naively applying its update interferes with existing capabilities. We reduce this interference with a simple recipe we term grafting, which changes where the update is learned and how it is applied: (1) learning the update on an earlier donor checkpoint, ideally even before the end of pretraining, and applying the weight update to the post-trained model; (2) scaling the weight update, equivalent to a form of model merging; and (3) optionally, masking the most sensitive update directions when the new data distribution is far from the post-trained model. Across continual learning settings including (1) distilling from expert traces, (2) self-improvement with STaR and Pedagogical RL, and (3) injecting knowledge after pretraining cutoff, grafting Pareto-dominates both SFT and OPSD in new-task and old-task performance, while avoiding expensive on-policy sampling. Therefore, our work challenges on-policy training as a necessity for continual learning on RL-trained models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in On-policy and self-distillation for LLMs, one of 12 directions in Knowledge distillation. Builds on 49 of its 58 references that are in the map. First posted on arXiv 5 Oct 2026.

Builds on

49 of 58 references.

Closest ancestors · 8

Same direction, newest first

  1. 2026Rethinking On-Policy Self-Distillation for Thinking Models6 Jul
  2. 2026Purified OPSD: On-Policy Self-Distillation Without Losing How to Think2 Jul
  3. 2026DOPD: Dual On-policy Distillation29 Jun
  4. 2026Why Does Self-Distillation (Sometimes) Degrade the Reasoning Capability of LLMs?25 Mar
  5. 2026Privileged Information Distillation for Language Models4 Feb
  6. 2026Reinforcement Learning via Self-Distillation28 Jan
  7. 2026Self-Distillation Enables Continual Learning27 Jan
  8. 2026Self-Distilled Reasoner: On-Policy Self-Distillation for Large Language Models26 Jan

Other references · 41

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  2. 2025Qwen3 Technical Reportcited by 8,820
  3. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  5. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
  6. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  7. 2022Editing Models with Task Arithmeticcited by 1,120
  8. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  9. 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 982
  10. 2022STaR: Bootstrapping Reasoning With Reasoningcited by 940
  11. 2023On-Policy Distillation of Language Models: Learning from Self-Generated Mistakescited by 939
  12. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
29 more
  1. 2021Robust fine-tuning of zero-shot modelscited by 797
  2. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  3. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
  4. 2025SFT Memorizes, RL Generalizes: A Comparative Study of Foundation Model Post-trainingcited by 672
  5. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  6. 2021Merging Models with Fisher-Weighted Averagingcited by 621
  7. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
  8. 2020What is being transferred in transfer learning?cited by 368
  9. 2024LoRA Learns Less and Forgets Lesscited by 328
  10. 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 221
  11. 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 191
  12. 2022Patching open-vocabulary models by interpolating weightscited by 190
  13. 2021Towards Continual Knowledge Learning of Language Modelscited by 174
  14. 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 146
  15. 2023Understanding Catastrophic Forgetting in Language Models via Implicit Inferencecited by 144
  16. 2023Task-Specific Skill Localization in Fine-tuned Language Modelscited by 105
  17. 2025Retaining by Doing: The Role of On-Policy Data in Mitigating Forgettingcited by 94
  18. 2025On the Interplay of Pre-Training, Mid-Training, and RL on Reasoning Language Modelscited by 69
  19. 2025Overtrained Language Models Are Harder to Fine-Tunecited by 58
  20. 2023Chat Vector: A Simple Approach to Equip LLMs with Instruction Following and Model Alignment in New Languagescited by 54
  21. 2025Weight Ensembling Improves Reasoning in Language Modelscited by 38
  22. 2024Does SGD really happen in tiny subspaces?cited by 36
  23. 2025RL Squeezes, SFT Expands: A Comparative Study of Reasoning LLMscited by 34
  24. 2025Nemotron-Math: Efficient Long-Context Distillation of Mathematical Reasoning from Multi-Mode Supervisioncited by 26
  25. 2025Shadow-FT: Tuning Instruct Model via Training on Paired Base Modelcited by 10
  26. 2026Sharpness-Aware Pretraining Mitigates Catastrophic Forgettingcited by 10
  27. 2026(How) Learning Rates Regulate Catastrophic Overtrainingcited by 6
  28. 2026CrispEdit: Low-Curvature Projections for Scalable Non-Destructive LLM Editingcited by 5
  29. 2026SFT Conflicts, RL Coexists: A Theoretical and Empirical Analysis of Multi-Task Learning for LLMscited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026On-Policy Replay for Continual Supervised Fine-Tuning
  2. 2026Learning without Overwriting: A Theory of Self-Distillation and Supervised Fine-Tuning in Continual Reasoning
  3. 2026Fast and Effective On-policy Distillation from Reasoning Prefixes
  4. 2026Understanding Off- vs On-Policy Distillation: A Tale of Distinct Training Objectives
  5. 2026Denser neq Better: Limits of On-Policy Self-Distillation for Continual Post-Training
  6. 2026On-Policy Self-Distillation without Any Supervision
  7. 2026Recursive Self-Improvement via On-Policy Distillation for Reasoning
  8. 2025Squeeze the Soaked Sponge: Efficient Off-policy Reinforcement Finetuning for Large Language Model