Table of Contents
Fetching ...

Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models

Yuchen Wu, Yuxin Chen, Yuting Wei

TL;DR

This work delivers a training-free, high-order stochastic Runge-Kutta diffusion sampler that provably accelerates SDE-based diffusion models. By leveraging an exponential integrator and RK-inspired score-difference corrections, it achieves $\\mathsf{KL}$-error $\\varepsilon^2$ with $\\widetilde{O}(d^{3/2}/\\varepsilon)$ score evaluations, improving the prior dimension dependency. Theoretical analysis dissects discretization, score-estimation, and initialization errors, and empirical results on CIFAR-10 and ImageNet-64 confirm practical gains over standard DDPM and prior SDE accelerators. The framework sets the stage for higher-order, training-free diffusion samplers and motivates future work on total-variation guarantees and structure-adaptive diffusion.

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 $\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.

Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models

TL;DR

This work delivers a training-free, high-order stochastic Runge-Kutta diffusion sampler that provably accelerates SDE-based diffusion models. By leveraging an exponential integrator and RK-inspired score-difference corrections, it achieves -error with score evaluations, improving the prior dimension dependency. Theoretical analysis dissects discretization, score-estimation, and initialization errors, and empirical results on CIFAR-10 and ImageNet-64 confirm practical gains over standard DDPM and prior SDE accelerators. The framework sets the stage for higher-order, training-free diffusion samplers and motivates future work on total-variation guarantees and structure-adaptive diffusion.

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 error -- measured in KL divergence -- using score function evaluations (for sufficiently small ), strengthening the state-of-the-art guarantees in terms of dimensional dependency. Numerical experiments validate the efficiency of the proposed method.
Paper Structure (37 sections, 19 theorems, 197 equations, 7 figures, 1 table, 1 algorithm)

This paper contains 37 sections, 19 theorems, 197 equations, 7 figures, 1 table, 1 algorithm.

Key Result

Theorem 3.4

Under Assumptions assumption:moments, assumption:step-size and assumption:score, Algorithm alg:stochastic-RK achieves

Figures (7)

  • Figure 1: Class-conditional ImageNet $64 \times 64$ samples generated using 250 sampling steps with our method (\ref{['alg:stochastic-RK']}).
  • Figure : Images generated using vanilla DDPM.
  • Figure : Images generated using vanilla DDPM.
  • Figure : Images generated using vanilla DDPM.
  • Figure : Images generated using our method.
  • ...and 2 more figures

Theorems & Definitions (40)

  • Remark 3.1
  • Remark 3.2
  • Remark 3.3
  • Theorem 3.4
  • Corollary 3.5
  • Remark 3.6
  • Lemma 4.1
  • Lemma 4.2
  • Lemma 4.3
  • Lemma 4.4
  • ...and 30 more