Hugging Face Trending Papers

Reverse-KL Policy Distillation: Statistical Guarantees and Limits

Reverse-KL Policy Distillation explores the statistical guarantees of training language models using reverse Kullback–Leibler divergence. The study compares online and offline distillation, showing that online learning requires more data when only the probability of the student’s chosen action is observed, while offline learning achieves the same minimax rate regardless of whether the teacher’s full distribution or only the probability of the teacher‑generated action is revealed. The work also demonstrates that standard online objectives can fail and introduces trajectory‑loss, importance‑ratio truncation, and policy‑space learning to attain optimal guarantees.

arXiv Machine Learning
Oct 23

Reverse-KL Policy Distillation: Statistical Guarantees and Limits

The paper investigates the statistical properties of Reverse‑Kullback‑Leibler (KL) policy distillation, focusing on how different feedback settings affect sample complexity. It shows that when the teacher reveals its full action distribution, online distillation achieves minimax rates, whereas revealing only the probability of the student‑generated action requires substantially more data. In contrast, offline distillation attains the same minimax rate regardless of whether the teacher’s full distribution or only the probability of the teacher‑generated action is revealed, because teacher‑generated actions expose the teacher’s preferences directly.

By Haolin Liu, Chen-Yu Wei, Julian Zimmert
arXiv AI
Sep 17

Trajectory Learnability for Offline On-Policy Distillation with Imperfect Teachers

The paper introduces a method for offline on‑policy distillation that addresses the problem of imperfect teacher supervision. By training on teacher‑successful problems and measuring changes in token likelihoods on teacher‑failed trajectories, the authors derive a learnability signal that weights the distillation loss. This approach improves performance on mathematical reasoning and code generation tasks while reducing computational cost compared to online distillation.

By Yihao Ai, Weilong Yan
arXiv Machine Learning
Aug 27

A Token-Level Analysis of Sampled-Token Reverse-KL On-Policy Distillation

The paper investigates how the sampled-token reverse-KL loss in on‑policy distillation distributes updates across tokens. By analyzing the gradient of the per‑token K2 estimator, the authors find that tokens with low student probability and large teacher‑student gaps receive disproportionately large gradient norms. They propose Surprise‑aware Reweighting (SuRe), a lightweight weighting rule that further amplifies this allocation, and demonstrate that SuRe improves math metrics on Qwen3 student models without harming out‑of‑domain performance.

By Bing Shao, Jiazheng Zhang, Long Ma, Yujiong Shen, Senjie Jin, Xin Guo, Yuming Yang, Mingxu Chai, Zhiheng Xi, Tao Gui, Qi Zhang, Xuanjing Huang
arXiv AI
Oct 1

Understanding Off- vs On-Policy Distillation: A Tale of Distinct Training Objectives

The paper investigates on‑policy distillation (OPD) versus supervised fine‑tuning (SFT), focusing on how students learn from multiple teachers by minimizing divergence. It shows that using forward KL divergence leads to a weighted arithmetic mixture, while reverse KL produces a normalized weighted geometric aggregate. The authors develop algorithms for both off‑policy and on‑policy settings, prove logarithmic regret bounds in tabular cases, extend the analysis to function approximation, and analyze how these aggregation targets explain OPD’s benefits and fragility.

By Qiwei Di, Xuheng Li, Kaixuan Ji, Chenggong Zhang, Heyang Zhao, Quanquan Gu
arXiv Computation and Language
Oct 9

When Do We Need On-Policy Distillation? Distilling on Offline Student Rollouts Is Often Better

The paper investigates whether on‑policy distillation (OPD) is always advantageous for transferring knowledge from a teacher to a student model. It introduces Semi‑OPD, which uses offline rollouts from the initial student, and demonstrates that across 17 teacher‑student pairs (1.5B–235B parameters) Semi‑OPD outperforms OPD in 14 cases, achieving up to +13.6% accuracy and an 11.4× speedup. The authors show that the benefit of OPD depends on the alignment between teacher and student, measured by an output‑token overlap ratio, and argue that effective distillation requires on‑policy behavior relative to both models.

By Siyan Zhao, Yonggan Fu, Jindong Jiang, Shih-Yang Liu, Song Bian, Byung-Kwan Lee, Sharath Turuvekere Sreenivas, Wenliang Dai, Hanrong Ye, Aditya Grover, Pavlo Molchanov
arXiv Statistics ML
Oct 2

Unbiased Top-$k$ Estimation for On-Policy Distillation

The paper introduces Tail‑Corrected Top‑k On‑Policy Distillation (TT‑OPD), a method that improves on existing Top‑k OPD by combining the selected top‑k tokens with a sampled token from the student’s rollout. This hybrid approach recovers the probability mass discarded by limiting to top‑k, yielding an unbiased estimator of the reverse KL divergence gradient while maintaining low computational cost. Experiments show TT‑OPD outperforms other OPD variants in accuracy.

By Linjian Meng, Siyuan Gan, YuHan Li, Xiran Wang, Ziyang Ding, Ditang Gou, Yiming Wu, Zhen Zhao
arXiv Machine Learning
Oct 23

When to Follow the Teacher: Advantage-Based On-Policy Distillation

The paper introduces Advantage-Based On-Policy Distillation (AOPD), a method that selectively weights teacher actions during online policy distillation by their counterfactual advantage to the student. Unlike standard OPD, which follows the teacher at every state, AOPD reinforces only those teacher actions that improve the student's expected outcome, using an estimator that relies solely on standard student rollouts and terminal rewards. Experiments on math, coding, and Medqa tasks demonstrate that AOPD outperforms both distillation and reinforcement learning baselines in external-teacher and self-distillation settings.

By Mahdi Sabbaghi, George Pappas, Hamed Hassani, Adel Javanmard
arXiv Machine Learning
Jun 5

Extreme Region Policy Distillation

arXiv:2605. 25582v2 Announce Type: replace Abstract: Reinforcement learning for large language models faces a fundamental trade-off between sample efficiency and asymptotic performance: strictly on-policy methods discard trajectories after a single update, while off-policy reuse introduces distribution mismatch that existing trust-region techniques mitigate primarily by enforcing conservative optimization, often leaving rich training signals underutilized.

By Changyu Chen, Xiting Wang, Rui Yan