Analyzing the Error of Generative Diffusion Models: From Euler-Maruyama to Higher-Order Schemes
Emanuel Pfarr, Radu Timofte, Frank Werner

TL;DR
This paper provides a comprehensive theoretical analysis of discretization errors in generative diffusion models, demonstrating that higher-order schemes can outperform Euler-Maruyama methods in sampling accuracy.
Contribution
It establishes the first error bounds for higher-order SDE discretization methods in GDMs, extending convergence analysis beyond Euler-Maruyama schemes.
Findings
Higher-order schemes can outperform Euler-Maruyama in practice.
All-at-once error bounds are derived for EM method under various score-matching errors.
Numerical experiments confirm the theoretical advantage of higher-order discretization methods.
Abstract
Although generative diffusion models (GDMs) are widely used in practice, their theoretical foundations remain limited, especially concerning the impact of different discretization schemes applied to the underlying stochastic differential equation (SDE). Existing convergence analysis largely focuses on Euler-Maruyama (EM)-like methods and does not extend to higher-order schemes, which are naturally expected to provide improved discretization accuracy. In this paper, we establish asymptotic 2-Wasserstein convergence results for SDE-based discretization methods employed in sampling for GDMs. We provide an all-at-once error bound analysis of the EM method that accounts for all error sources and establish convergence under all prevalent score-matching error assumptions in the literature, assuming a strongly log-concave data distribution. Moreover, we present the first error bound result for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods · Generative Adversarial Networks and Image Synthesis
