- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper characterizes the branch-error dynamics, negative branch asymmetry (NBA), under teacher’s privileged negative conditioning during the on-policy distillation of diffusion models with classifier-free guidance. To mitigate the issue, the paper proposes positive direction matching (PDM) that separately match the positive branches between teacher and student, and the CFG conditional direction.
Critical strengths
-
The paper is well-written and easy to follow.
-
The analysis of branch error in Fig 2 validates the problem.
-
The paper demonstrates the proposed method with diverse experiments.
Critical weaknesses
- The theoretical justification of PDM is limited to zero-loss case. The paper argues that zero PDM loss forces . However, in the “privileged” setting, zero loss may be unattainable since the student's conditioning does not fully determine the teacher's predictions. Since the student’s negative branch is conditioned only on the null prompt, whenever the student can match the teacher's expected guided output at most at a single , regardless of the objective. Therefore, zero-loss identifiability alone does not explain PDM's robustness across scales.
- The proposed problem is valid (Fig 2). But the problem depends on the CFG configuration, where the teacher’s negative branch is privileged. If the teacher’s negative branch is not privileged, both negative branches share the same input, which the paper’s own analysis suggests may fall into the benign regime. In that case, the problem could be avoided without the proposed loss.
Questions for authors
-
Could the authors characterize what the minimizer of PDM is and why it is a reasonable approach? Otherwise, the results remain empirical.
-
Could the authors evaluate, for example, the teacher’s negative branch without reference? If it performs worse, this could strengthen the motivation.
3 comments
Weakness 2 & Question 2 - CFG Configuration
Thank you for raising these related points. We agree that NBA depends on the teacher's CFG configuration, and the revised paper now states this scope explicitly in Sec. 6. We address both the suggested negative-branch reconfiguration and its effect on the teacher in our response to Reviewer TSgv, “Weakness 1 & Question 1 - Isolate Negative-Branch Conditioning” (revised Fig. 2, Table 3, and Fig. 10).
Dear reviewer czaJ:
As the discussion period closes in a few hours, we wanted to thank you once again for your insightful review and constructive questions on the zero-loss argument and the teacher’s CFG configuration.
In case it is helpful for a quick final check, here is a brief pointer to our updates in the responses and revised paper:
- Beyond zero loss: Sec. 3.2 and Appendix 7.1 now characterize PDM’s population minimizer under the stated assumptions.
- CFG configuration: We added within-setting negative-branch comparisons and a teacher-output example (revised Fig. 2, Table 3, and Fig. 10).
We appreciate your time and would welcome any further questions.
Weakness 1 & Question 1 — Branch-Level Optima Beyond Zero Loss
Thank you for drawing attention to the zero-loss assumption. We agree that exact teacher matching may be impossible when the teacher has privileged information. Our central claim is that PDM can still select a unique pair of student branch predictions when zero loss is unattainable. We have clarified this distinction in Sec. 3.2 and added a population-loss analysis in Appendix 7.1.
Setup. We fix the distribution of supervised states, assume finite second moments, and allow each student branch to be any function of its inputs. Let x contain the inputs shared by the student branches and y the additional positive-branch input. Write f(x,y)=vS+ and h(x)=vS−. For the teacher, define
b=\mathbb E[\mathbf v_T^-\mid x,y],\qquad \bar b=\mathbb E[\mathbf v_T^-\mid x].$$ If $b\neq\bar b$ with nonzero probability, $h(x)$ cannot reproduce $b(x,y)$ from its inputs alone, and exact matching of the expected guided output at two distinct guidance scales is impossible. **This does not settle the question above: naive matching and PDM can still differ in whether their population optima determine the student branches.** **Naive matching.** At a fixed $\gamma>0$, its population loss is minimized when $$\gamma f+(1-\gamma)h=\gamma a+(1-\gamma)b.$$ For any choice of $h(x)$, one can choose $f(x,y)=[\gamma a+(1-\gamma)b-(1-\gamma)h]/\gamma$ to satisfy this equation. Thus matching one guided prediction does not determine the student's negative branch. **Positive–Direction Matching.** The expected PDM loss can be written as $$J_{\mathrm{PDM}}=C+\mathbb E \left[\|[\|f-a[\|\|_2^2+\lambda[\|\|f-h-(a-b)[\|\|_2^2\right],$$ where $C$ is independent of $f$ and $h$. For a fixed $h$, minimizing over $f$ gives $$\begin{aligned} f_h^\star &= a-\frac{\lambda}{1+\lambda}(b-h),\\\\ J_{\mathrm{PDM}}(f_h^\star,h)&=C+\frac{\lambda}{1+\lambda}\mathbb E\|b-h\|_2^2. \end{aligned}$$ Since $h$ can depend only on $x$, minimizing the remaining term over $h(x)$ gives $$h^\star=\bar b,\qquad f^\star=a-\frac{\lambda}{1+\lambda}(b-\bar b).$$ For $\lambda>0$, this population minimizer is unique up to sets of probability zero. In particular, $h^\star=\bar b$ is the best negative-branch prediction available from $x$, while the positive branch balances matching $a$ against matching the conditional direction. The minimum loss remains positive when $b\neq\bar b$ with nonzero probability. The key distinction is that guided-only matching leaves $h$ free, whereas PDM identifies both branches at the population optimum even when exact teacher matching is impossible. This result does not guarantee that a parameterized student reaches the optimum or matches the teacher at every guidance scale; the guidance-sweep results in revised Table 3 provide the empirical evidence for robustness.