- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes a residual-guided framework for accelerating diffusion and flow sampling. It approximates the frozen velocity field’s acceleration using a learned linear combination of the current state and velocity, and uses the approximation residual to guide timestep selection through a propagation-weighted minimax objective. The resulting schedules can also be transferred to existing solvers. Experiments on CIFAR-10 and ImageNet-256 show improvements over uniform-grid baselines, particularly at low evaluation budgets, but the lack of comparisons with directly relevant methods such as LD3 and AMED leaves the incremental benefits over existing learned scheduling and solver approaches insufficiently established.
Critical strengths
- A coherent and computationally lightweight sampling construction. The paper connects acceleration approximation, local discretization error, and timestep allocation through a common residual. Learning only two scalar coefficients keeps the base model frozen and introduces no additional velocity-field evaluations during sampling. The distinction between the exact forward-interpolant identity and the approximate reverse-flow representation is stated clearly.
- Useful empirical improvements with informative component analysis. The CIFAR-10 experiments separate several effects of the correction and scheduling, and the transfer to existing solvers is practically relevant. For example, on ImageNet-256 without CFG at NFE 16, AB2-DPA improves FID from 11.4 to 9.46. At guidance 1.375 and NFE 30, it achieves FID 2.17 versus the reported DSS result of 2.24. The paper also reports recall, residual diagnostics, parameter sensitivity, and substantial implementation details, while acknowledging settings where improvements diminish or reverse.
Critical weaknesses
- Missing comparisons with directly relevant learned sampling methods. The paper learns acceleration coefficients and optimizes timestep placement, but does not compare with LD3 or AMED, despite citing both. LD3 directly targets learned timestep scheduling, while AMED and subsequent methods such as Consistency Solver and AdaSDE have demonstrated strong few-step sampling performance. Without comparisons against these relevant baselines, the practical advantage of the proposed framework remains unclear.
- The incremental benefit of the learned correction is not sufficiently established relative to its offline cost. The competitive AB2-DPA results do not require the learned coefficient head. On ImageNet-256, Table 2 omits the SAS-U, SAS-DPA, EUL-DPA, and HEU-DPA controls needed to separate the head’s contribution from scheduling. The CIFAR-10 results also show mixed benefits: for 2-RF at NFE 4, SAS-U worsens FID from 4.63 to 9.02, although recall improves. Appendix A.10 transparently reports approximately 185 GPU-hours for target collection, 4 hours for head training, and 160 GPU-hours for separate profiling in the SiT setup. However, it remains unclear when the full learned pipeline offers a favorable quality–cost tradeoff over the simpler scheduling-only variants.
Questions for authors
See weaknesses, especially weakness 1.