资讯

Token Utility for On-Policy Distillation via Local Trust-Region Optimization

📅 2026-10-15 ⏱️ 约 6 分钟阅读 ✍️ AI导航编辑部 🔗 arxiv.org
Token Utility for On-Policy Distillation via Local Trust-Region Optimization
📝 内容摘要

Computer Science > Machine Learning [Submitted on 1 Oct 2026] Title:Token Utility for On-Policy Distillation via L

📌 核心要点

  • Computer Science > Machine Learning
  • [Submitted on 1 Oct 2026]
  • From: Narayanan Sadagopan [view email][v1] Thu, 1 Oct 2026 20:01:20 UTC (1,992 KB)

Computer Science > Machine Learning

[Submitted on 1 Oct 2026]

Title:Token Utility for On-Policy Distillation via Local Trust-Region Optimization

View PDF HTML (experimental)Abstract:Token-selection methods for on-policy distillation (OPD) prioritize student-visited positions using diverse signals, including uncertainty, teacher-student disagreement, and mismatch direction. We instead derive token importance from the distillation objective itself: how much can each position's loss decrease under an equal local KL budget on the student's predictive distribution? The answer is the utility $s_t=g_t^\top F_t^\dagger g_t$, where $g_t$ is the logit gradient and $F_t$ is the categorical Fisher matrix. For reverse-KL it equals the student-weighted variance of the student-teacher log-probability ratio, and for forward-KL it equals the Pearson $\chi^2$ divergence, so the appropriate utility follows from the choice of objective. On shared training checkpoints, several independently motivated criteria, including student entropy, KL disagreement, and TIP, concentrate their importance on nearly the same positions as the derived utility at a 50\% selection fraction, while diverging at stricter fractions and for direction-specific criteria. We instantiate the utility as Fisher Utility Weighting (FUW), a continuous, mean-normalized token weighting. Across seven mathematical reasoning benchmarks and three Qwen3 student-teacher pairs, FUW improves over matched uniform OPD under both reverse-KL (1.35-4.0 macro points) and forward-KL (1.08-2.71 macro points), and is competitive with existing selective methods using a single closed-form score derived from the training objective.

Submission history

From: Narayanan Sadagopan [view email][v1] Thu, 1 Oct 2026 20:01:20 UTC (1,992 KB)

Additional Features

References & Citations

Loading...

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)

Connected Papers (What is Connected Papers?)

Litmaps (What is Litmaps?)

scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub (What is DagsHub?)

Gotit.pub (What is GotitPub?)

Hugging Face (What is Huggingface?)

ScienceCast (What is ScienceCast?)

Demos

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)

CORE Recommender (What is CORE?)

IArxiv Recommender

(What is IArxiv?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

来源arxiv.org· 本文为编辑整理,仅供参考