- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces Dancing Diffusion, a novel framework that transforms the traditional single-instruction diffusion sampling trajectory into a program of addressable operations. While standard diffusion models condition every step on the same static prompt, Dancing Diffusion assigns dedicated continuous condition blocks to different time intervals using a learned compiler. This enables the generation path to "dance"—meaning the model can execute and preserve an early shared prefix history while dynamically redirecting its subsequent continuation toward alternative target instructions.
Critical strengths
Traditional diffusion models condition every sampling step on the same static instruction, preventing intervention or addressing at the level of individual operations. The paper's compiler-executor architecture maps text features into dedicated continuous condition blocks across temporal intervals, effectively turning conditioning into a latent program. This innovation allows the generation trajectory to "dance"—preserving executed history while redirecting its future continuation.
By resuming a saved state and reusing an executed prefix, the method significantly enhances background and scene structure retention compared to full regeneration (e.g., reducing background LPIPS by up to 36% at early branches) and outperforms native prompt switching. Crucially, it achieves this improved retention while maintaining or enhancing image quality, lowering the FID below native SANA, and saving 22% to 23% in computation time when producing multiple continuations from a cached prefix.
Critical weaknesses
The authors acknowledge that semantic control over individual operations remains limited because later branches weaken the edit. Furthermore, block interventions demonstrate routing rather than a true training-induced semantic factorization of the conditioning blocks. This reveals a gap between the conceptual motivation of the method and its actual operational mechanism.
Cross-schedule comparisons combine schedule variations with disparate initialization histories (such as joint warm starts versus training from scratch), which limits causal interpretations across schedules. Additionally, the automated multimodal judge evaluations show no consistent trained-compiler advantage alongside substantial order disagreement, which weakens the empirical robustness of the editing efficacy claims.
Questions for authors
Given that block interventions primarily demonstrate routing rather than a true training-induced semantic factorization, can the authors clarify how to achieve more precise semantic control over individual operations, especially since later branches weaken the edit effect?
Because cross-schedule comparisons mix schedule choices with disparate initialization histories (e.g., 3/9/18 starting from scratch while 6/12/12 and 9/12/9 inherit a 40-update joint warm start), how can we isolate the true causal impact of the schedule from these initialization differences?
Hi authors,
If you are planning to respond to the reviews, I am happy to receive your responses to my concerns in stages. This would also allow us to engage in further discussion and clarification, given that only 1 day remain before the discussion phase ends.
Thanks!