FP FlashPapers | Deep Dive
Multi-Teacher On-Policy Distillation

Beyond Domain-Routed Supervision: Cross-Teacher Guarding for MOPD

Shi-Yu Tian*1,2, Yong Liu*2, Ximan Liu†2, Tianrui Zhu2, Sule Bai2, Xinwei Yang2, Ruiqi Liu2, Kun-Yang Yu1, Ming Yang1, Zhi Zhou‡1, Yu-Feng Li‡1, Yipeng Sun2, Simiu Gu2
1Nanjing University  •  2JD.com  •  (*Equal contribution, †Project leader, ‡Corresponding authors)

TL;DR (The 30-Second Summary)

Standard multi-teacher distillation routes each prompt solely to its domain expert, causing severe gradient interference on shared student weights—slumping medical accuracy by up to 14.5 points when trained jointly with math. ROAD MOPD turns non-routed teachers into auxiliary critics on the exact same student rollout: filtering contradictory token rewards via agreement gating, and preventively projecting away conflicting gradient components under a target-norm floor.

24% → 76% Conflicting Batches As teacher disagreement rises, the fraction of batches with negative gradient cosine grows from 24% to 40% (Math) and from 46% to 76% (Medical) (Fig. 2).
Zero Extra Rollouts Auxiliary teachers evaluate the same student-generated prefix under teacher forcing during training, adding training cost.
+5.6 to +8.8 pts Gain Restores disadvantaged medical domain in high-conflict settings though at 1.7B ROAD's Math and Code scores can fall below some baselines.
Motivation & Diagnosis

Why This Matters: The Domain Routing Trap

When training frontier reasoning models via on-policy distillation (OPD), a student model generates a response and receives dense, step-by-step token supervision from a stronger teacher. But no single teacher excels at everything: mathematics requires rigorous deductive proofs, code demands syntax and algorithmic invariants, while medical diagnosis requires cautious clinical triage and differential judgment.

The natural industry practice has been Domain Routing: split prompt batches by domain, route math prompts to a Math teacher, code prompts to a Code teacher, and medical prompts to a Medical teacher. It seems completely intuitive.

Yet, Tian et al. uncover a stark failure mode: While updates are separated at prompt dispatch, they act on identical, shared weights $\theta$. When teachers diverge in formatting, tone, and reasoning structure, their gradients actively tear shared parameters apart.

Interactive Diagnostic: Layer Gradient Conflict vs. Benchmark Degradation

Fig. 1 Reproduction

Select a domain pairing to inspect how layer-wise gradient collisions translate directly into capability collapse in standard Vanilla MOPD compared to single-domain OPD.

Score Impact (Vanilla MOPD − Single OPD)

Severe negative degradation in Medical (-14.45 pts on MedQA), while Math remains positive.

Core Innovation

The Big Idea: Cross-Teacher Guarding

Why wait until post-hoc gradient aggregation to realize two teachers despise each other's suggestions? And why assume an auxiliary teacher has nothing to say about a target domain rollout?

The core insight of ROAD MOPD is to recruit non-routed teachers as auxiliary cross-domain critics on the identical student trajectory. Notice the computational elegance: the student model generates only one rollout $y \sim \pi_\theta(\cdot \mid x)$ on a target prompt. Both the assigned teacher $T_r$ and peer teacher $T_a$ score those exact token IDs under teacher forcing.

Vanilla MOPD vs. ROAD MOPD Architecture Dual Guard Mechanism

Vanilla MOPD (Domain-Routed) Domain A ($D_A$) Domain B ($D_B$) Teacher A ($T_A$) Isolated supervision Teacher B ($T_B$) Isolated supervision $g_A$ $g_B$ 💥 $\langle g_A, g_B \rangle < 0$ Shared weights degrade ROAD MOPD: Cross-Teacher Guarding Student Policy $\pi_\theta$ Rollout ($x \sim D_d$) Single trajectory $y = (y_1, y_2, \dots, y_T)$ Routed $T_r$ $\ell^r_t$ Ref $\pi_{ref}$ $\ell^{ref}_t$ Auxiliary $T_a$ $\ell^a_t$ 1. Cross-Teacher Credit Assignment ($s_t$ gate) Modulate reward scale $\lambda_t = \text{clip}(1 + \rho_g s_t, 0.5, 1.5)$ per token ✓ Jointly supported tokens upweighted; clashes downweighted 2. Preventive Multi-Teacher Gradient Projection Derive auxiliary gradient $g'_d$ from exact same rollout Project $g_d \to \tilde{g}_d$ subject to norm floor $\|\tilde{g}\|_2 \ge m \|g\|_2$ ($m=0.6$) Eliminates update friction before aggregating parameters!
Method Deep Dive

How It Works: The Dual-Guard System

1 Token-Level Credit Assignment via Teacher Agreement

In traditional On-Policy Distillation, a static reward multiplier $\lambda$ scales all tokens uniformly:

$$J_\lambda(\theta) = \mathbb{E}_\theta \left[ \sum_{t=1}^T \left\{ \lambda \left( \ell^T_t - \ell^{\text{ref}}_t \right) - \left( \ell^\theta_t - \ell^{\text{ref}}_t \right) \right\} \right]$$

where $\ell^T_t, \ell^\theta_t, \ell^{\text{ref}}_t$ are log-probabilities of token $y_t$ given prefix $h_t$ under the teacher, student, and frozen reference. But reasoning rollouts contain a blend of universal structural markers (e.g. "Wait, let me double check") and hyper-specific domain preferences.

ROAD MOPD replaces the global scalar $\lambda$ with an agreement coefficient $\lambda_t$. For target teacher $T_r$ and auxiliary peer $T_a$, their token agreement relative to baseline $\pi_{\text{ref}}$ is:

$$s_t = \underbrace{\tanh\left( \frac{\ell^r_t - \ell^{\text{ref}}_t}{\tau} \right)}_{\text{routed-teacher evidence}} \times \underbrace{\tanh\left( \frac{\ell^a_t - \ell^{\text{ref}}_t}{\tau} \right)}_{\text{auxiliary-teacher evidence}}, \quad s_t \in [-1, 1]$$

The adaptive multiplier modulates the advantage:

$$\lambda_t = \text{clip}\left(1 + \rho_g s_t, \; \lambda_{\min}, \; \lambda_{\max}\right)$$

When both teachers favor the same change relative to baseline ($s_t > 0$), $\lambda_t > 1$ amplifies the learning signal. When they disagree ($s_t < 0$), $\lambda_t < 1$ attenuates supervision. Crucially, the auxiliary teacher is not treated as a domain solver, but as a compatibility sensor.

Interactive Sandbox: Token Agreement Gate ($s_t$) & Multiplier ($\lambda_t$) Live Formula
Routed Teacher Evidence $(\ell^r_t - \ell^{\text{ref}}_t)$: +1.20
Auxiliary Teacher Evidence $(\ell^a_t - \ell^{\text{ref}}_t)$: +0.90
Temperature $\tau = 1.0$ Strength $\rho_g = 0.5$ Clip: $[0.5, 1.5]$
Gate Calculation
Agreement $s_t$
+0.597
Multiplier $\lambda_t$
1.298×
✓ High Consensus: Both teachers agree. Token reward is amplified by +29.8%.
Simulated Generation Stream Excerpt (from Math domain with Medical critic)
Wait perhaps I should make sure that the equations hold. Alternatively, let's verify.
Amplified ($\lambda_t > 1$) Attenuated ($\lambda_t < 1$) Neutral ($\approx 1.0$)

2 Preventive Gradient Projection under Norm Retention

Token-level weighting filters isolated tokens, but gradient vectors aggregate over hundreds of tokens into the same weight matrices. If target-domain gradient $g_d = \nabla_\theta \mathcal{L}^{\text{agr}}_d$ points counter to the auxiliary gradient on that same trajectory $g'_d = \nabla_\theta \mathcal{L}'_{d \to a}$, parameter updates can harm other domains.

When $\langle g, g' \rangle < 0$, classic gradient surgery like PCGrad performs full orthogonal projection:

$$g_{\text{full}} = g - \frac{\langle g, g' \rangle}{\|g'\|_2^2} g'$$

The Problem with Full Projection: If $g$ and $g'$ are almost opposite ($\theta \to 180^\circ$), full projection practically erases the gradient ($\|g_{\text{full}}\| \to 0$), starving the target domain of learning capacity!

ROAD MOPD introduces an adaptive norm-retention constraint with retention floor $m \in (0, 1]$ (set to $m=0.6$ in experiments):

$$\tilde{g} = \arg\min_{v \in \text{conv}\{g, g_{\text{full}}\}} -\langle v, g' \rangle \quad \text{subject to } \|v\|_2^2 \ge m^2 \|g\|_2^2$$

The closed-form solution scales projection fraction $\alpha^* \in [0, 1]$:

$$\tilde{g} = g - \alpha^* \frac{\langle g, g' \rangle}{\|g'\|_2^2} g', \quad \alpha^* = \begin{cases} 0, & c \ge 0 \\ 1, & c < 0 \text{ and } \sqrt{1 - c^2} \ge m \\ 1 - \sqrt{1 - \frac{1 - m^2}{c^2}}, & c < 0 \text{ and } \sqrt{1 - c^2} < m \end{cases}$$

where $c = \frac{\langle g, g' \rangle}{\|g\|_2 \|g'\|_2} = \cos \theta$ is the gradient alignment. If full projection preserves at least $60\%$ of the target norm ($\sqrt{1-c^2} \ge 0.6$), it applies full conflict removal ($\alpha^*=1$). Otherwise, it projects as much as legally permitted without dropping below the $60\%$ norm floor.

Interactive Vector Canvas: Target Gradient vs. Auxiliary Gradient Live Geometry Demo

Drag the angle slider below to rotate the Auxiliary Gradient $g'$. Watch how Full Projection (PCGrad style) dangerously collapses the gradient norm as conflict approaches $180^\circ$, while ROAD MOPD's adaptive floor $m$ retains target learning power.

Angle between $g$ and $g'$: 145°
Norm Floor $m$: 0.60
Cosine $c = \cos\theta$: -0.819
Full proj norm $\sqrt{1-c^2}$: 0.573
ROAD Proj fraction $\alpha^*$: 0.938
ROAD Retained Norm: 0.600 (Floor clamped)
Target Domain $g$ (length = 1.0)
Auxiliary Direction $g'$
Full Proj $g_{\text{full}}$ (PCGrad)
ROAD Guarded $\tilde{g}$

3 Multi-Teacher Extension & Shared Norm Budgeting

What happens when scaling to $K > 2$ teachers (e.g. Math, Code, and Medical jointly)? ROAD MOPD scales naturally along both guards:

  1. Multi-Teacher Credit Assignment: For a target domain $d$ with peer set $\mathcal{P}_d = \{j \mid j \ne d\}$, the agreement scores are averaged across all $K-1$ peers before gating: $$\bar{s}_{d,t} = \frac{1}{K-1} \sum_{j \in \mathcal{P}_d} \tanh\left(\frac{\ell^d_t - \ell^{\text{ref}}_t}{\tau}\right) \tanh\left(\frac{\ell^j_t - \ell^{\text{ref}}_t}{\tau}\right)$$
  2. Sequential Projection under a Shared Norm Floor: Peers are ordered by their conflict severity (most negative cosine first). Crucially, the floor is preserved relative to the original target tensor $g^{(0)}_d$, not refreshed locally: $$\|g^{(q)}_d\|_2 \ge m \|g^{(0)}_d\|_2, \quad q = 1, \dots, K-1$$ This prevents cascading projections from silently whittling down the gradient norm to zero.
Empirical Proof

Experimental Results Across 11 Benchmarks

The authors evaluate ROAD MOPD against state-of-the-art baselines: Vanilla MOPD (Ma et al., 2026), ExOPD (Yang et al., 2026b), CaMOPD (Chen et al., 2026), and Open-MOPD (Gao et al., 2026). Evaluations span 11 standardized benchmarks:

  • Math (Avg@32): AIME 2024, AIME 2025, HMMT Feb 2025, HMMT Nov 2025.
  • Code (Avg@4): HumanEval+, MBPP+, LiveCodeBench v6 (2025).
  • Medical (Avg@1): MedQA (USMLE), MedXpertQA, MedMCQA, SuperGPQA-Med.

Benchmark Explorer & Method Comparison

Numbers taken from the paper's tables (Math × Code and 3-domain results are 4B only).

Method Domain 1 Domain 2 All Average Visual Bar (All Avg)

Ablation Analysis (Table 4):Tian et al. dissect the exact contribution of each mechanism:

  • Without Credit Assignment: Performance plunges by $-1.82$ pts in Math and $-3.48$ pts in Code, supporting the view that token-level agreement gating is critical for preserving fine-grained reasoning.
  • Without Gradient Protection: Medical accuracy in Code $\times$ Medical drops by $-0.88$ pts, suggesting that token filtering alone cannot eliminate destructive parameter collisions.
  • Adaptive Retention vs. Full Projection: Replacing the adaptive floor with blind full projection (PCGrad style) drops overall 2-domain mean by $-0.83$ pts in Math $\times$ Medical and $-0.44$ pts in Code $\times$ Medical, corroborating the danger of over-projection.
Critical Assessment

Limitations & Open Questions

Computational Overhead of Auxiliary Passes

While ROAD MOPD cleverly avoids extra trajectory sampling by reusing the student rollout, it requires auxiliary forward passes to compute $\ell^a_t$ and separate backward passes on each tensor to establish $g'_d$. In large clusters, this adds GPU-hour overhead compared to naive routing.

Scalability Beyond 3 Domains

Experiments evaluated pairings and triplets across Math, Code, and Medicine. Scaling to dozens of domains in generalist LLM pre-training will require sparse teacher selection heuristics or dynamic gating, rather than all-to-all peer criticism.

Sequential Projection Dependency

For $K > 2$, sequential projection with a shared budget $m$ prioritizes the most negative cosine peer. Later projections could alter alignment with previous peers. Simultaneous multi-objective quadratic programming remains an open avenue.

Tokenizer Compatibility Requirement

ROAD MOPD assumes compatible tokenizers between student and teachers (here, all Qwen3 checkpoints) so token IDs align during teacher forcing. Extending to heterogeneous tokenizers requires soft probability mapping.

Reference

Glossary of Key Terms

On-Policy Distillation (OPD)

Knowledge distillation where the student model generates its own token completions (on-policy rollout), and a teacher model evaluates those exact tokens under teacher-forcing, eliminating training-inference distribution shifts.

Multi-Teacher On-Policy Distillation (MOPD)

An architecture where specialized domain teachers (e.g. Math, Code, Medical) transfer their expertise into a single unified student model.

PCGrad (Projecting Conflicting Gradients)

A classic multi-task gradient surgery technique (Yu et al., 2020) that modifies already-computed task gradients by projecting each onto the normal plane of the other whenever their dot product is negative. Unlike ROAD MOPD, it computes gradients on separate batches and lacks norm retention floors.

Norm Retention Floor ($m$)

A safety parameter in ROAD MOPD (default $m=0.6$) requiring that any projected gradient $\tilde{g}$ retains at least $m$ fraction of the original target gradient's $\ell_2$ norm ($\|\tilde{g}\|_2 \ge m \|g\|_2$), preventing gradient vanishing when teachers acutely conflict.

BibTeX

Citation

@article{tian2026beyond,
  title   = {Beyond Domain-Routed Supervision: Cross-Teacher Guarding for Multi-Teacher On-Policy Distillation},
  author  = {Tian, Shi-Yu and Liu, Yong and Liu, Ximan and Zhu, Tianrui and Bai, Sule and Yang, Xinwei and Liu, Ruiqi and Yu, Kun-Yang and Yang, Ming and Zhou, Zhi and Li, Yu-Feng and Sun, Yipeng and Gu, Simiu},
  journal = {arXiv preprint arXiv:2610.13521},
  year    = {2026}
}
Made with Flash Papers — make your own ↗