Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
Gen Li, Yuting Wei, Yuxin Chen, Yuejie Chi

TL;DR
This paper develops non-asymptotic convergence theories for diffusion models, showing improved rates for deterministic and stochastic samplers, and introduces accelerated variants with faster convergence.
Contribution
It provides the first non-asymptotic convergence analysis for diffusion models in discrete time with minimal assumptions, and proposes accelerated sampling methods.
Findings
Deterministic sampler convergence rate improved to 1/T
Stochastic sampler achieves 1/√T convergence rate matching state-of-the-art
Accelerated variants reach 1/T^2 and 1/T convergence rates
Abstract
Diffusion models, which convert noise into new data instances by learning to reverse a Markov diffusion process, have become a cornerstone in contemporary generative modeling. While their practical power has now been widely recognized, the theoretical underpinnings remain far from mature. In this work, we develop a suite of non-asymptotic theory towards understanding the data generation process of diffusion models in discrete time, assuming access to -accurate estimates of the (Stein) score functions. For a popular deterministic sampler (based on the probability flow ODE), we establish a convergence rate proportional to (with the total number of steps), improving upon past results; for another mainstream stochastic sampler (i.e., a type of the denoising diffusion probabilistic model), we derive a convergence rate proportional to , matching the…
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
TopicsMarkov Chains and Monte Carlo Methods · Bayesian Methods and Mixture Models · Generative Adversarial Networks and Image Synthesis
MethodsDiffusion
