反向 KL 蒸馏要理论边界:Google reverse-KL,在线全分布 vs 单点概率样本复杂度殊途
反向 KL 蒸馏要理论边界:Google reverse-KL,在线全分布 vs 单点概率样本复杂度殊途
View PDF HTML (experimental) Abstract: Reverse Kullback-Leibler (KL) distillation has shown empirical promise for training language models, but its statistical guarantees and limits remain poorly understood. In particular, the effects of two design choices remain unclear:...
Google reverse-KL 蒸馏研究 (arXiv:2610.30844)
“View PDF HTML (experimental) Abstract: Reverse Kullback-Leibler (KL) distillation has shown empirical promise for training language models,”
Abstract:Reverse Kullback-Leibler (KL) distillation has shown empirical promise for training language models, but its statistical guarantees and limits remain poorly understood. In particular, the effects of two design choices remain unclear: Does access to the teacher's full action distribution provide an advantage over observing only the probability it assigns to the sampled action? Must training trajectories come from the student (online distillation), or can teacher-generated trajectories (offline distillation) suffice? Our work takes a first step toward understanding the theory underlying these questions.
We study the sample complexity of online reverse-KL distillation under two feedback models: the teacher reveals either its full action distribution or only the probability of the student-generated action. We establish minimax bounds for the former and show that substantially more data may be required for the latter. In contrast, offline reverse-KL distillation can attain the same minimax rate whether the teacher reveals its full distribution or only its probability of the teacher-generated action. The key distinction is that teacher-generated actions themselves reveal the teacher's preferences, while queries at student-selected actions can leave those preferences unobserved. This highlights an additional statistical challenge for online distillation compared to offline distillation.
These statistical guarantees do not follow simply from optimizing standard distillation objectives: our lower bounds show that common online objectives can fail when candidates are evaluated only on past student-generated trajectories. We develop trajectory-loss and importance-ratio truncation techniques together with policy-space learning to achieve optimal online distillation guarantees.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2610.30844 [cs.LG] |
| (or arXiv:2610.30844v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.30844 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Haolin Liu [view email]
[v1]
Thu, 22 Oct 2026 07:19:49 UTC (61 KB)
Source: Agent Control Flash News · arxiv.org
Related Products & Analysis
Cursor Agent 架构全景拆解:从影子工作区到多文件推演引擎
全面剖析 Cursor 在 Agent 模式下的底层技术实现,解析影子分支隔离、LSP 上下文剪枝以及预测性补全的核心架构细节与工程实践经验。
Vercel v0 推出全新多 Agent 协作画布与实时全栈部署预览
动态速评:v0 正在从单一组件生成器演进为全栈应用搭建协作台,尤其是与 Neon/Postgres 的直连极大降低了全栈原型验证成本。