Optimal Convergence Analysis of DDPM for General Distributions
Yuchen Jiao, Yuchen Zhou, Gen Li

TL;DR
This paper provides a refined theoretical analysis of DDPM, establishing near-optimal convergence rates under general distributional assumptions and revealing insights into its efficiency compared to DDIM.
Contribution
The paper introduces a relaxed smoothness condition and proves a tight convergence rate for DDPM, improving understanding of its theoretical performance.
Findings
Achieves a convergence rate of d/T^2 in KL divergence.
Improves upon previous rates when the smoothness parameter L is small.
Shows DDPM and DDIM have similar dependence on data dimension d.
Abstract
Score-based diffusion models have achieved remarkable empirical success in generating high-quality samples from target data distributions. Among them, the Denoising Diffusion Probabilistic Model (DDPM) is one of the most widely used samplers, generating samples via estimated score functions. Despite its empirical success, a tight theoretical understanding of DDPM -- especially its convergence properties -- remains limited. In this paper, we provide a refined convergence analysis of the DDPM sampler and establish near-optimal convergence rates under general distributional assumptions. Specifically, we introduce a relaxed smoothness condition parameterized by a constant , which is small for many practical distributions (e.g., Gaussian mixture models). We prove that the DDPM sampler with accurate score estimates achieves a convergence rate of…
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 · Stochastic Gradient Optimization Techniques
