Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models
<|reference_start|>Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models: 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 $\varepsilon^2$ error -- measured in KL divergence -- using $\widetilde O(d^{3/2} / \varepsilon)$ score function evaluations (for sufficiently small $\varepsilon$), strengthening the state-of-the-art guarantees $\widetilde O(d^{3} / \varepsilon)$ in terms of dimensional dependency. Numerical experiments validate the efficiency of the proposed method.<|reference_end|>
@article{wu2024stochastic,
    title={Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion
  Models},
    author={Yuchen Wu, Yuxin Chen, Yuting Wei},
    journal={arXiv preprint arXiv:2410.04760},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.04760},
    primaryClass={stat.ML cs.LG}
}