AIarXiv

Ranked by formulaVerdict: Routine

Recovering Reliable Supervision via Critique-Guided On-Policy Distillation

On-policy distillation (OPD) trains a student model on its own rollouts with token-level supervision from a teacher, assuming that the teacher can reach a correct answer from any prefix the student writes.

By Zhao, Yu, Li +4

Score█████░░░░░5.4

Caveats

  • Preprint; not yet peer reviewed.

VerdictCompetent work. Briefs at most.

Read the originalPDFCode

Abstract

On-policy distillation (OPD) trains a student model on its own rollouts with token-level supervision from a teacher, assuming that the teacher can reach a correct answer from any prefix the student writes. We call this property the recoverability of the teacher and show it fails on incorrect rollouts: the teacher follows student errors, although it recognizes them. We propose CriticOPD, using error recognition to restore recoverability. The teacher critiques an incorrect rollout, allowing the student to rewrite its solution following the error. The resulting output, including the critique as privileged information, is scored by the teacher while the student uses the revision without the critique for training. On two Qwen3 students and six mathematical reasoning benchmarks, CriticOPD improves OPD, with the largest gains on competition problems.

Kaixiang Zhao, Tianrun Yu, Shangzhe Li, Yuxiao Yang, Amanda Hughes, Weitong Zhang, Taylor W. Killian

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude██░░░ 218%Solid incremental gain on a meaningful problem.
Evidence██░░░ 214%Limited: single setting, weak baselines, or an observational association presented as causal.
Novelty██░░░ 216%A new combination of known ideas.
Trajectory██░░░ 218%Some room to improve with obvious engineering.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose, named contribution); verification (code released); stakes (general AI).

How the score was computed

rank-2026-10-07

Score█████░░░░░5.4

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Merit
3.7 / 10
Weighted rubric, evidence-gated.
Adjusted merit
3.9 / 10
Shrunk toward the desk prior by editor confidence (36%).
Attention
82%
Citations, upvotes, points, mentions.
Freshness
79%
Half-life decay since publication.
  • Hugging Face upvotes61 (reference 25, via hf-daily, Oct 15, 2026, 13:49 UTC)
  • GitHub stars1 (reference 250, via hf-daily, Oct 15, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v6 on Oct 15, 2026, 02:05 UTC. Paper type: method.
  • Categories: cs.LG, cs.AI
  • BRIEF, No.5 in the Artificial Intelligence edition of October 15, 2026.