Source-linked AI summary

Prune-OPD: Efficient and Reliable On-Policy Distillation for Long-Horizon Reasoning

Zhicheng Yang, Zhijiang Guo, Yifan Song, Minrui Xu, Yongxin Wang, Yiwei Wang, Xiaodan Liang, Jing Tang

arXiv:2605.07804v3cs.LGcs.AI

TL;DR

Long-horizon OPD can spend substantial computation on drifted student prefixes where dense teacher rewards become unreliable. Prune-OPD monitors local compatibility, attenuates rewards after drift, and dynamically controls rollout length. Across low-compatibility regimes, it reduces training time by 37.6%–68.0% while preserving benchmark performance and retaining long-context supervision when compatibility remains high.

  • Problem

    Long-horizon OPD can produce unreliable dense teacher rewards when student reasoning prefixes drift from the teacher’s reasoning process.

  • Method

    PRUNE-OPD monitors local student-teacher compatibility, converts cumulative drift into monotone reward attenuation, and dynamically controls response length.

  • Results

    37.6%–68.0% lower training time is reported in low-compatibility regimes while benchmark performance is preserved, and long-context supervision remains open when compatibility is high.

  • Takeaways & Limitations

    Long-horizon OPD can allocate computation toward locally exploitable teacher supervision rather than blindly shortening rollouts.

  • Takeaways & Limitations

    The experiments are limited to math reasoning with DeepSeek, Qwen, and Skywork-style models, leaving agentic and multi-turn settings for future work.

Abstract

from arXiv · show

On-policy distillation (OPD) leverages dense teacher rewards to enhance reasoning models. However, scaling OPD to long-horizon tasks exposes a critical flaw: as the student's generated prefix inevitably diverges from the teacher's thought process, the teacher's dense reward loses local exploitability. Continuing to generate and evaluate tokens on these ``drifted'' trajectories not only degrades reward quality but also incurs massive computational waste. To address this, we introduce \textbf{Prune-OPD}, a framework that dynamically aligns training budgets with supervision quality. By continuously monitoring the local compatibility between student and teacher predictions (e.g., via top-$k$ overlap), Prune-OPD detects prefix-drift events in real time. Upon detecting severe drift, it monotonically down-weights subsequent unreliable rewards and triggers dynamic rollout truncation. This allows the training process to halt futile generation and reallocate compute strictly to reliable teacher supervision. Across diverse teacher-student combinations, Prune-OPD consistently aligns computation with supervision reliability. When prefix drift makes dense teacher rewards unreliable, it reduces training time by 37.6\%--68.0\% while preserving, and often improving, performance on challenging benchmarks (AMC, AIME, HMMT). When student-teacher compatibility remains high, it automatically preserves long-context supervision by expanding the training window. These results suggest that Prune-OPD improves OPD not by blindly shortening rollouts, but by reallocating computation toward locally exploitable teacher rewards.

1 Introduction

OPD provides dense on-policy supervision, but long-horizon prefix drift can make later teacher rewards unreliable and waste computation. PRUNE-OPD responds by monitoring compatibility, attenuating unreliable rewards, and dynamically truncating rollouts while preserving supervision when compatibility remains high.

  • 1 Introduction: OPD evaluates teacher predictions on student-generated prefixes, providing token-level supervision rather than relying only on sparse final-answer rewards.Its on-policy design addresses exposure bias by training on prefixes the student actually visits.
  • 1 Introduction: Long-horizon OPD can lose reward reliability as student reasoning diverges from the teacher, making uniformly supervised suffixes costly and locally unexploitable.A single rollout may contain an early compatible prefix followed by a drifted suffix.
  • 1 Introduction: PRUNE-OPD monitors position-level student-teacher compatibility and converts detected prefix drift into reward attenuation and dynamic response-length control.The method uses top-k overlap as its primary signal and supports stricter teacher action-acceptance checks.
  • 1 Introduction: 37.6%–68.0% lower training time is reported when dense supervision becomes unreliable, while downstream benchmark performance is preserved or improved.The controller also retains long-context supervision when compatibility remains high.
  • 1 Introduction: PRUNE-OPD frames long-horizon OPD as reliability allocation: computation is directed toward prefixes where teacher supervision remains actionable rather than shortened indiscriminately.This design preserves the baseline OPD path when the modifier is disabled.

2 Background and Problem Setup

OPD supplies dense teacher signals on student-generated trajectories, but their usefulness depends on local compatibility between teacher and student distributions. PRUNE-OPD turns compatibility diagnostics into online reward and rollout controls for long-horizon trajectories.

  • 2 Background and Problem Setup: OPD samples trajectories from the current student and evaluates teacher distributions on the student-generated prefixes.The response is autoregressively sampled, with y<t denoting the prefix before position t.
  • 2 Background and Problem Setup: Token-level decomposition gives every response position a dense teacher signal and permits position-wise reliability weighting before the policy loss.Reliable prefixes retain their OPD rewards, whereas drifted prefixes receive attenuated rewards.
  • 2 Background and Problem Setup: The overlap ratio measures whether student and teacher assign high probability to a shared candidate region.The entropy gap instead tracks similarity in their uncertainty on the same visited state.
  • 2 Background and Problem Setup: PRUNE-OPD promotes these diagnostics to online controls, using overlap or stricter top-p/top-k action acceptance to assess compatibility on each student prefix.This differs from using the metrics only as post-training diagnostics.
  • 2 Background and Problem Setup: As prefix depth increases, student trajectories can drift from teacher-generated reasoning, so dense rewards may become unreliable and require position-level attenuation.The resulting controller allocates supervision to reliable prefixes rather than raw token positions alone.

3 PRUNE-OPD

PRUNE-OPD uses local student-teacher compatibility on student-generated prefixes to identify prefix drift, attenuate unreliable rewards, and control rollout budgets dynamically. Its reliability weights decay monotonically after compatibility failures, while the response-length controller expands or contracts training limits according to reliable supervision.

  • Compatibility metric: PRUNE-OPD evaluates student and teacher on the same student-generated prefix to determine whether teacher supervision remains locally exploitable.Its primary compatibility signal compares high-confidence candidate-token regions using an overlap ratio.
  • Compatibility metric: Low overlap marks a prefix-drift event because the teacher’s preferred next-token support has separated from the student’s support.These events are accumulated to attenuate later OPD rewards and define effective reliable length.
  • Cumulative reliability and loss weighting: The raw reliability weight is a clipped linear decay that is monotone non-increasing along valid responses after compatibility failures.A base floor prevents the method from becoming a hard switch and allows retention of weak teacher signal.
  • Cumulative reliability and loss weighting: PRUNE-OPD scales OPD rewards by position-wise reliability weights while leaving padding positions with zero loss weight.Tokens with zero reliability can still contribute a small reward when the base weight is positive, but they are excluded from reliable length.
  • Dynamic response budget: The dynamic response controller expands the rollout limit when many samples reach the reliable-length limit and contracts it after sustained low hit ratios.The limit remains bounded by configured minimum and maximum response lengths.

4 Experiments

Experiments evaluate PRUNE-OPD across teacher-student pairs, benchmarks, compatibility regimes, and efficiency controls. The results show substantial training-time savings while generally preserving accuracy, with dynamic behavior adapting to supervision reliability.

  • Experimental setup: Experiments measure pass@1 accuracy, relative training-time reduction, response length, overlap ratio, top-p acceptance, and effective reliable length across five benchmarks.The evaluation covers AMC23, AIME24, AIME25, HMMT24, and HMMT25 under matched student-teacher comparisons.
  • Main results: Across low-compatibility runs, PRUNE-OPD reduces training time by 35.7%, 68.0%, 37.6%, and 52.6% while keeping benchmark accuracy close to OPD.Accuracy changes are mixed across individual benchmarks, so the primary result is efficiency without meaningful degradation.
  • Training dynamics: When compatibility remains high, PRUNE-OPD expands the training window to 12288 tokens, with training time and accuracy nearly unchanged from OPD.This demonstrates that the controller preserves long-context supervision rather than uniformly shortening rollouts.
  • Ablation study: Fixed 4K truncation can degrade performance by discarding useful long-prefix supervision, unlike compatibility-aware pruning.The comparison shows why rigid length rules cannot distinguish drifted suffixes from compatible long trajectories.
  • Main results: Overlap ratio generally outperforms top-p acceptance because candidate-space support provides a smoother reliability signal for long reasoning traces.The top-p variant is more conservative and often weaker than overlap.
  • Ablation study: At γ = 0.7, PRUNE-OPD preserves OPD-level benchmark performance while reducing training time by 35.7%.The threshold controls how permissive pruning is: higher thresholds prune earlier and may remove useful reasoning.

5 Related Work

Prior work frames OPD through its divergence objective, data-mixture flexibility, and interpretation as dense KL-constrained reinforcement learning.

  • MiniLLM formalized OPD for LLMs with a reverse-KL objective optimized by policy gradient.
  • GKD extended OPD by interpolating between on-policy and off-policy data under multiple divergences.
  • Recent theory interprets OPD as dense KL-constrained RL, where the teacher’s per-token log-ratio acts as an implicit reward.

6 Conclusion

The conclusion frames OPD inefficiency as a local-reliability problem and presents PRUNE-OPD as a compatibility-aware method for allocating rewards and computation.

  • PRUNE-OPD checks local student–teacher compatibility, converts cumulative failures into drift, rescales rewards, and controls response length.
  • 37.6%–68.0% training-time reductions occur in low-compatibility regimes while benchmark performance is preserved.
  • When compatibility remains high, PRUNE-OPD keeps the long training window open instead of truncating automatically.
  • Efficient long-horizon OPD should allocate dense supervision according to local exploitability on student-visited prefixes.

A.1 Broader Impact

The paper claims that PRUNE-OPD can reduce training resources for reasoning models while acknowledging risks associated with broader access to stronger reasoning capabilities.

  • PRUNE-OPD is presented as a mechanism for mitigating reward hacking and training instability from low-quality or drifted teacher signals.
  • The authors warn that stronger reasoning models could lower barriers to sophisticated misinformation or dual-use content.
  • The paper recommends using PRUNE-OPD with safety-aligned teacher models and rigorous verifiable RL frameworks.

A.2 LLM Usage Declaration

The authors state that LLMs were used only for language editing and textual polishing, while the research itself was authored and validated by the authors.

  • LLMs were used strictly for language editing and textual polishing to improve presentation quality.
  • The authors declare responsibility for the ideas, methodology, experiments, and analysis, with AI-modified content reviewed and validated.

A.3 Limitations

PRUNE-OPD has several reliability and scope limitations, including dependence on local top-k statistics, a monotone decay assumption, and evaluation restricted to math reasoning.

  • Top-k overlap may miss large ranking or score differences between student and teacher distributions.The top-p action-acceptance variant may instead be overly strict for stylistically different but valid reasoning paths.
  • Linear decay assumes local compatibility tracks reward exploitability, even though compatibility may recover after an earlier low-overlap prefix.This makes the monotone attenuation potentially conservative when later states become teacher-compatible.
  • PRUNE-OPD only rescales OPD rewards and does not provide a GRPO fallback for zero-reliability tokens.
  • Experiments are limited to math reasoning with DeepSeek-, Qwen-, and Skywork-style models, leaving agentic and multi-turn settings untested.

A.4 Future Work

The supplied future-work and supporting material points toward reliability-gated objectives, stronger compatibility controls, and broader evaluation while preserving the distinction between reliable and unreliable supervision.

  • Future Work: A natural extension would switch unreliable suffixes from OPD to GRPO after reliability decays to zero.Before that point, dense OPD guidance would remain active on locally compatible prefixes.
  • Reliability Rationale: PRUNE-OPD treats cumulative compatibility failure as a path-dependent signal for attenuating later suffix rewards, not proof that every low-overlap token is wrong.
  • Reliability Rationale: Monotone decay avoids re-amplifying suffix rewards after repeated drift events, even if later tokens regain local compatibility.The separate base weight distinguishes reliability estimation from optimization scale.
  • Compatibility Metrics: The stricter action-level metric marks a bad event when the sampled student token falls outside the teacher’s observable top-p/top-k region.Reported top-p runs use p = 0.95.
  • Results: Low-overlap Qwen3 pairs improve both training efficiency and benchmark accuracy, with PRUNE-OPD retaining only a few hundred effective tokens versus a 12,288-token OPD budget.The result is associated with attenuating gradients from long, drifted suffixes.
  • Results: Compatibility is most fragile in later depth bands, where uniform dense rewards are least likely to remain useful.
  • Results: A higher reliability threshold triggers earlier decay and shorter budgets, whereas a lower threshold preserves longer suffix supervision.The main setting γ = 0.7 balances these behaviors.
Loading 2605.07804v3…