- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes a novel framework for offline optimization of discrete timestep schedules for diffusion and flow-based samplers, named EP-Flow. It derives a tractable surrogate cost that decomposes terminal sampling error into bias, variance, and discretization terms weighted by trajectory-dependent propagators. Experiments across EDM/EDM2, Stable Diffusion v1.5, and FLUX.1-dev validate improved few-step generation quality at matched solver, endpoints, and NFE.
Critical strengths
1.A principled, propagation-aware objective with exact degenerate cases. Eqs. 8 and 13 explain how local errors propagate along the trajectory, while Appendix F derives uniform-t and logSNR-uniform spacings under idealized conditions, highlighting deviations in modern models (as shown in Fig. 1).
2.Broad evaluation across model families. Table 1 covers EDM, EDM2, SD v1.5, and FLUX.1-dev under matched solvers, endpoints, and NFE settings.
Critical weaknesses
1.Overstated improvements. Table 1 shows a slight regression on FFHQ 64×64 at NFE=18 (FID 9.86 vs. 9.74 for Karras), contradicting the claimed consistent gains across all EDM datasets. The authors should qualify this claim.
2.Limited validation. Section 4.2.1 introduces a piecewise-kernel formulation to address the failure of A1 on SD v1.5, but neither the two-regime choice nor schedule sensitivity to segmentation is ablated.
Questions for authors
1.Table 1 shows a regression on FFHQ 64×64 at NFE=18 (9.86 vs. 9.74 for Karras). How does the objective behave as headroom shrinks at higher NFE, and can the claim in the abstract be scoped (e.g., to NFE ≤ 14 or to low-NFE regimes)?
2.For the piecewise kernel on SD v1.5 (as in Appendix C.2), how sensitive is the optimized schedule and the resulting GenEval/HPSv2 gain to the number of segments and their boundaries? A sensitivity study would substantiate the "robustness beyond stationarity" claim in Section 5.1.
Response to the Reviewer fY1D
We thank the reviewer for the feedback. We address each concern with additional experimental evidence and clarifications below.
Q2 & W1 (Comparison with existing methods).
We clarify a central misunderstanding: EP-Flow neither distills reference trajectories nor redesigns numerical solvers. Related to AYS [9] and Xue et al. [10], EP-Flow advances analytical schedule optimization from local errors to global error propagation.
Learned solvers (S4S [5], GAS [6], BNS [7], AMED [8]) modify integration rules and thus fall outside our fixed-solver scope. Teacher-based methods (GITS [1], LD3 [2], OSS [3]) instead distill reference trajectories. All these methods are cited in the revised manuscript, with their distinctions further clarified in Appendix B (Table 11).
Beyond AYS and CTR in the main paper, we further refine HSO [4] on SD v1.5 and OSS [3] on FLUX.1-dev. Table 12 shows improvements under matched solvers, endpoints, and NFEs, demonstrating the complementary value of our objective across different approaches.
Q1 & W2 (Theoretical validity and propagation ablation).
We respectfully clarify that our framework does not rely on six compounding approximations. The listed components differ fundamentally:
Optimizing principled bounds rather than exact endpoint errors is standard practice. AYS [9] optimizes a KL upper bound, while Xue et al. [10] optimize a discretization-error upper bound. Neither claims to characterize the exact endpoint error. Our cost agrees with FID rankings across Karras schedules (Appendix A.2, Table 6), with further evidence in Tables 7–8.
Excerpt from Table 6 (EDM, CIFAR-10):
The reviewer-requested ablation further strengthens our central claim. Removing propagation (Γ≡I) with all other settings unchanged worsens FID in 15/16 settings (Appendix A.1, Table 5).
Q3 & W3 (Anisotropic correction).
All main results use the isotropic formulation without tuning. Anisotropic correction is studied solely to validate the theoretical prediction, using GenEval Overall as a quality proxy.
W5 (Statistics reuse).
Statistics are reusable across NFEs, endpoints, and equivalent parameterizations, and jointly collectible across solvers (full details in Appendix C, Table 13). The 3 A6000 GPU-hour collection cost can be reduced through batching and shared evaluations.
Q3 & W4 (Optimization robustness).
Different local optima are expected for our non-convex objective. Each comparison starts from its baseline schedule. We use 3 restarts (seed 42, under 1 minute each) and select the lowest-cost solution. Hyperparameters are in Appendix I. Across restarts, lower cost generally corresponds to better FID (Tables 7–8), supporting the reliability of cost-based schedule selection.
References
[9] Sabour, A., Fidler, S., and Kreis, K. Align Your Steps: Optimizing Sampling Schedules in Diffusion Models. ICML, 2024.
[10] Xue, S., Liu, Z., Chen, F., Zhang, S., Hu, T., Xie, E., and Li, Z. Accelerating Diffusion Sampling with Optimized Time Steps. CVPR, 2024.