Metraipolis › archive › dc_ebbe4b08c040

Trajectory Learnability for Offline On-Policy Distillation with Imperfect Teachers — arXiv:2609.18321

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18321
License (as archived)
CC0-1.0
Archived
2026-10-15T15:04:42.842Z
SHA-256 of the archived text
bbd3ecdb7144ee3c0b0d4813e4e81b380e852dc9d944970e62394888b4d33978
Stable URL of this page
https://metraipolis.com/documento/dc_ebbe4b08c040

How to cite

Trajectory Learnability for Offline On-Policy Distillation with Imperfect Teachers — arXiv:2609.18321 — arXiv (en), https://arxiv.org/abs/2609.18321 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ebbe4b08c040 (Metraipolis archive dc_ebbe4b08c040, sha256 bbd3ecdb7144ee3c0b0d4813e4e81b380e852dc9d944970e62394888b4d33978)
BibTeX
@misc{dcebbe4b08c040,
  title = {Trajectory Learnability for Offline On-Policy Distillation with Imperfect Teachers — arXiv:2609.18321},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18321},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ebbe4b08c040; sha256 bbd3ecdb7144ee3c0b0d4813e4e81b380e852dc9d944970e62394888b4d33978},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18321. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Offline on-policy distillation gains efficiency by collecting student trajectories and teacher supervision once and reusing them throughout optimization. The same reuse makes imperfect supervision persistent. Since even strong teachers can fail, we ask \emph{what remains learnable from imperfect teacher supervision?} Teacher failure is only a coarse problem-level signal and does not imply that all supervision along the associated student trajectory is unhelpful. A natural alternative is to estimate teacher recoverability along the trajectory, but repeated continuations largely erase the efficiency advantage of offline distillation. We instead use teacher-successful problems to define a cheap reference for what the student can learn. We train on teacher-successful problems and measure how the likelihood of each observed token in trajectories from teacher-failed problems changes. We use these signed likelihood changes as an operational \emph{learnability signal}: larger increases indicate behavior more strongly promoted by successful-only learning. We aggregate this signal into trajectory-level weights for the original distillation loss. Unlike continuation-based estimates, our learnability requires no additional generation and can be computed once from stored trajectories and model checkpoints. Across mathematical reasoning and code generation, our method improves an offline OPD baseline by up to 2.7 percentage points and matches or outperforms online OPD variants on multiple benchmarks. Despite the additional successful-only distillation stage, it uses 2 GPUs and about 22 GPU hours, compared with 3 GPUs and 36--48 GPU hours for representative online OPD methods.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-17 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.18321 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T14:08:19.120Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).