mlsanityData to 7 Oct 2026

Near-Policy: Accelerating On-Policy Distillation via Asynchronous Generation and Selective Packing

arXiv 2605.05940 ↗First posted 7 May 2026cs.LG cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Standard knowledge distillation for autoregressive models often suffers from distribution mismatch. While on-policy methods mitigate this by leveraging student-generated outputs, they rely on computationally expensive Reinforcement Learning (RL) frameworks. To improve efficiency, we propose Near-Policy Distillation (NPD), an asynchronous approach that decouples student generation from training. This reformulation enables Supervised Fine-Tuning (SFT) with sequence packing. However, asynchronous updates inevitably introduce policy lag and sample noise, which can cause the behavior to drift from near-policy toward off-policy. To counteract this without sacrificing efficiency, NPD integrates sparse student updates and the Delta-IFD filtering mechanism, a heuristic sample selection mechanism that empirically stabilizes the optimization trajectory. By filtering extreme out-of-distribution samples, Delta-IFD prevents noise from dominating the gradients, ensuring updates remain within a safe proximal learning zone. Empirically, the NPD framework achieves a 8.1x speedup over on-policy baselines and outperforms SFT by 8.09%. Crucially, by effectively narrowing the exploration space for subsequent RL, our method enables openPangu-Embedded-1B to reach a state-of-the-art score of 68.73%, outperforming the substantially larger Qwen3-1.7B. Codes will be released soon.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 30 references that are in the map. First posted on arXiv 7 May 2026.

Builds on

25 of 30 references.

References · 25

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2025Qwen3 Technical Reportcited by 8,195
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  6. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  7. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  8. 2021Program Synthesis with Large Language Modelscited by 3,509
  9. 2023Qwen Technical Reportcited by 3,273
  10. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  11. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
  12. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
13 more
  1. 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
  2. 2023On-Policy Distillation of Language Models: Learning from Self-Generated Mistakescited by 840
  3. 2016Sequence-Level Knowledge Distillationcited by 761
  4. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
  5. 2023C-Eval: A Multi-Level Multi-Discipline Chinese Evaluation Suite for Foundation Modelscited by 694
  6. 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 436
  7. 2023From Quantity to Quality: Boosting LLM Performance with Self-Guided Data Selection for Instruction Tuningcited by 301
  8. 2020CLUE: A Chinese Language Understanding Evaluation Benchmarkcited by 277
  9. 2024DistiLLM: Towards Streamlined Distillation for Large Language Modelscited by 145
  10. 2025DistiLLM-2: A Contrastive Approach Boosts the Distillation of LLMscited by 73
  11. 2025Pangu Embedded: An Efficient Dual-system LLM Reasoner with Metacognitioncited by 61
  12. 2024Star-Agents: Automatic Data Optimization with LLM Agents for Instruction Tuningcited by 14
  13. 2025Pangu Ultra MoE: How to Train Your Big MoE on Ascend NPUscited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.