English

Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models

Machine Learning 2024-10-08 v1 Machine Learning

Abstract

Diffusion models play a pivotal role in contemporary generative modeling, claiming state-of-the-art performance across various domains. Despite their superior sample quality, mainstream diffusion-based stochastic samplers like DDPM often require a large number of score function evaluations, incurring considerably higher computational cost compared to single-step generators like generative adversarial networks. While several acceleration methods have been proposed in practice, the theoretical foundations for accelerating diffusion models remain underexplored. In this paper, we propose and analyze a training-free acceleration algorithm for SDE-style diffusion samplers, based on the stochastic Runge-Kutta method. The proposed sampler provably attains ε2\varepsilon^2 error -- measured in KL divergence -- using O~(d3/2/ε)\widetilde O(d^{3/2} / \varepsilon) score function evaluations (for sufficiently small ε\varepsilon), strengthening the state-of-the-art guarantees O~(d3/ε)\widetilde O(d^{3} / \varepsilon) in terms of dimensional dependency. Numerical experiments validate the efficiency of the proposed method.

Keywords

Cite

@article{arxiv.2410.04760,
  title  = {Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models},
  author = {Yuchen Wu and Yuxin Chen and Yuting Wei},
  journal= {arXiv preprint arXiv:2410.04760},
  year   = {2024}
}

Comments

45 pages, 3 figures

R2 v1 2026-06-28T19:10:44.068Z