Summary (Overview)

  • On-policy distillation (OPD) of diffusion models under classifier-free guidance (CFG) is shown to be under-identified at the branch level: matching only the CFG-composed velocity allows positive- and negative-branch errors to cancel each other, creating infinitely many degenerate solutions.
  • This ambiguity becomes harmful when the teacher’s negative branch contains privileged information unavailable to the student, leading to a failure mode called Negative Branch Asymmetry (NBA): the positive-branch error decreases while the negative-branch error increases during training.
  • The authors propose Positive–Direction Matching (PDM), a branch-aware objective that separately constrains the positive prediction and the CFG conditional direction, eliminating cross-branch error compensation.
  • PDM is applied to dense-to-sparse video control (pose, depth, scribble), where naive guided matching exhibits severe sensitivity to inference guidance scale, while PDM and a simpler baseline (Independent Branch Matching, IBM) remain stable and improve control fidelity.
  • Key insight: NBA is diagnosed by excess degradation relative to the teacher or a branch-aware student under guidance-scale shifts, not by an absolute CFG-free performance drop.

Introduction and Theoretical Foundation

Classifier-free guidance (CFG) (Ho & Salimans, 2022) is the standard inference mechanism for modern diffusion models. The denoising velocity is a composition of two branch predictions:

v~=γv++(1γ)v\tilde{v} = \gamma v^+ + (1 - \gamma) v^-

where v+v^+ is the positive branch (under target condition) and vv^- is the negative branch (under null or negative condition), with guidance scale γ>1\gamma > 1.

On-policy distillation (OPD) trains a student model by querying a teacher along the student’s own denoising trajectory. The natural extension of OPD to CFG-based models is to match the composed velocities:

Lnaive=ExtSpθ,t[w(t)γe++(1γ)e22]\mathcal{L}_{\text{naive}} = \mathbb{E}_{x_t^S \sim p_\theta, t} \left[ w(t) \| \gamma e^+ + (1-\gamma) e^- \|_2^2 \right]

where e+=vT+vS+e^+ = v_T^+ - v_S^+ and e=vTvSe^- = v_T^- - v_S^- are the positive- and negative-branch errors.

This objective is under-identified at the branch level: the condition γe++(1γ)e=0\gamma e^+ + (1-\gamma) e^- = 0 admits infinitely many non-zero pairs (e+,e)(e^+, e^-), allowing the two errors to compensate without changing the composed prediction. The paper investigates when this ambiguity becomes harmful.

Methodology

Negative Branch Asymmetry (NBA)

Under privileged negative conditioning (e.g., teacher’s negative branch retains reference images or dense control signals unavailable to the student), the teacher’s negative target cannot be directly reproduced by the student. The composed objective then induces antagonistic branch-error dynamics: reducing e+2\|e^+\|_2 while increasing e2\|e^-\|_2. This failure mode is named NBA.

PDM: Positive–Direction Matching

To prevent cross-branch error compensation, PDM supervises the predictions before CFG composition. Define the CFG conditional direction:

dM=vM+vMd_M = v_M^+ - v_M^-

The PDM loss is:

PDM=e+22+λdTdS22=e+22+λe+e22\ell_{\text{PDM}} = \|e^+\|_2^2 + \lambda \| d_T - d_S \|_2^2 = \|e^+\|_2^2 + \lambda \| e^+ - e^- \|_2^2

where λ>0\lambda > 0 controls direction-matching strength. Zero PDM loss implies e+=e=0e^+ = e^- = 0, eliminating compensation freedom.

Baseline: Independent Branch Matching (IBM)

IBM directly matches both branches with per-branch weights:

IBM=γ2e+22+(γ1)2e22\ell_{\text{IBM}} = \gamma^2 \|e^+\|_2^2 + (\gamma-1)^2 \|e^-\|_2^2

Like PDM, it removes cross-branch interaction but uses a different parameterization.

Efficient Supervision for Video

For dense-to-sparse video control, the authors supervise only the first KK student-visited states, reducing cost while maintaining performance:

LOPD(K)=E[1Kk=0K1w(tk)(xtkS,tk)]\mathcal{L}_{\text{OPD}}^{(K)} = \mathbb{E} \left[ \frac{1}{K} \sum_{k=0}^{K-1} w(t_k) \ell(x_{t_k}^S, t_k) \right]

Empirical Validation / Results

Branch-Error Dynamics (Figure 2)

Two image-domain distillation settings are contrasted:

  • Shared negative conditioning (text-rendering): both branch errors decrease jointly under all objectives (benign regime).
  • Privileged negative conditioning (reference-conditioned): naive matching reduces e+2\|e^+\|_2 while increasing e2\|e^-\|_2 — NBA. PDM suppresses this negative-branch degradation.

Intrinsic vs. Distillation-Induced CFG Sensitivity

Table 1 (text-rendering) shows that naive and PDM students closely track the teacher’s intrinsic CFG response — no excess sensitivity introduced.

Methodγ=1γ=2γ=3γ=4γ=4.5
Teacher75.2492.9194.1694.4394.09
OPD (Naive)73.8792.7294.5294.4394.11
OPD (PDM)74.4893.7393.9994.0294.38

In reference-conditioned distillation (Figure 3), naive matching departs from the teacher at off-scale γ, producing visual distortion and style drift, while PDM remains stable.

Main Results on Dense-to-Sparse Video Control

Table 2 reports results at γ=5 across three modalities. PDM provides the most consistent improvements over naive OPD, SFT, and off-policy distillation.

Pose-ControlMPJPE↓ All/KeyPCK@0.2↑ All/KeyPCK@0.1↑ All/KeyFID↓FVD↓
Teacher3.03/2.8296.02/96.4691.15/92.2314.1356.01
OPD (Naive)4.43/3.1491.84/95.2580.28/89.3513.4965.12
OPD (PDM)4.13/2.8392.98/96.1282.48/91.0313.5262.77

Similar patterns hold for depth and scribble modalities.

Guidance-Scale Generalization

Table 3 shows that naive OPD degrades sharply when inference γ differs from training γ=5 (e.g., MPJPE All 8.98 at γ=1), while PDM and IBM remain stable.

Methodγ=5γ=3γ=1
Naive (MPJPE↓)4.624.948.98
PDM (MPJPE↓)4.274.174.48
Naive (FVD↓)67.44134.09507.70
PDM (FVD↓)58.6555.8560.97

Ablation Studies

Table 4 (direction-matching weight λ): λ=1 provides best control fidelity; larger λ improves distributional quality but weakens control.

Table 5 (supervision horizon K): K=8 gives strongest control fidelity while being substantially cheaper than full-trajectory (K=50) supervision.

Theoretical and Practical Implications

  • Theoretical: The paper identifies a previously unrecognized failure mode in CFG-based OPD — NBA — and shows that branch-level ambiguity is not always harmful but becomes problematic under privileged negative conditioning. This provides a principled understanding of when and why naive guided matching fails.
  • Practical: PDM is a simple, drop-in replacement for the naive OPD loss that requires no architectural change. It improves robustness to inference guidance-scale shifts and control fidelity in dense-to-sparse video control. The efficient supervision strategy (supervising only early steps) makes OPD practical for video models.
  • Broader impact: The findings apply to any OPD setting where the teacher’s CFG schema retains privileged information in the negative branch (e.g., reference images, dense control signals, auxiliary modalities). Branch-aware objectives should be preferred in such cases.

Conclusion

The paper demonstrates that CFG-composed OPD is under-identified at the branch level, leading to NBA under privileged negative conditioning. PDM resolves this by separately supervising the positive prediction and CFG conditional direction. Experiments on text-rendering, reference-conditioned distillation, and dense-to-sparse video control confirm that PDM improves guidance-scale robustness and knowledge transfer.

Limitations: The relative behavior of PDM and IBM is not theoretically characterized; PDM’s advantage is empirical. Future work may extend NBA analysis to other guidance mechanisms and teacher–student conditioning asymmetries.

Related papers