This forum post reviews the paper "Rethinking Classifier-Free Guidance in On-Policy Diffusion Distillation" by Bingnan Li, Haozhe Wang, Haozhong Xiong, et al. (arXiv:2607.24731, cs.CV / cs.AI / cs.LG).
Key points
The setup: CFG and on-policy distillation
- Diffusion models generate images/videos by learning to iteratively denoise, predicting a velocity field. Their controllability is boosted by Classifier-Free Guidance (CFG), which combines two predictions:
- On-Policy Distillation (OPD) trains a fast student model to imitate a slow but strong teacher via velocity matching: the student generates trajectories and matches the teacher's per-step velocity predictions.
- The combined CFG target is under-identified at the branch level: many different (v_cond, v_uncond) pairs produce the same v̂. A student matching only v̂ can converge to a solution where branch errors cancel out—correct combination, wrong internals.
- When the teacher's negative branch contains privileged information the student cannot access (stronger priors, richer training), the student's branch errors show antagonistic dynamics: the positive branch improves while the negative branch degrades, like a seesaw, so overall matching quality eventually drops.
- The author illustrates this with an analogy: an apprentice copying a master chef's final dish can taste the result but not the secret ingredient in the master's "casual" baseline version—so the apprentice's baseline silently drifts wrong.
- Applied to dense-to-sparse video control, a task sensitive to guidance strength.
- Naive guided matching is highly sensitive to the inference-time guidance weight w, with quality fluctuating sharply.
- PDM stays stable and high-quality across guidance strengths, confirming it resolves NBA.
- "Looking correct" is not the same as "being correct": composite outputs can hide internal misalignment—a caution for any distillation involving combined predictions (multi-task learning, multimodal fusion, etc.).
- Even "default" configurations like CFG can contain hidden pitfalls when used as training targets; branch-level analysis is necessary.
- PDM amounts to "honest teaching": rather than exposing all teacher internals (impossible), it makes learning targets explicit per branch.
v̂ = v_uncond + w · (v_cond − v_uncond)
where w is the guidance strength. The output blends a positive branch (conditional) and a negative branch (unconditional).
The problem: Negative Branch Asymmetry (NBA)
The fix: Positive-Direction Matching (PDM)
PDM disentangles the objective instead of matching the blended output:
1. Directly match the positive branch: student's v_cond ↔ teacher's v_cond. 2. Match the CFG conditional direction: student's (v_cond − v_uncond) ↔ teacher's (v_cond − v_uncond).
Each component then has an explicit target, eliminating error-cancellation artifacts.
Experiments
Why it matters
Reference
Li, B., Wang, H., Xiong, H., et al. *Rethinking Classifier-Free Guidance in On-Policy Diffusion Distillation*. arXiv:2607.24731.