REVIEW 9 cited by
Convergence Analysis for General Probability Flow ODEs of Diffusion Models in Wasserstein Distances
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Score-based generative modeling with probability flow ordinary differential equations (ODEs) has achieved remarkable success in a variety of applications. While various fast ODE-based samplers have been proposed in the literature and employed in practice, the theoretical understandings about convergence properties of the probability flow ODE are still quite limited. In this paper, we provide the first non-asymptotic convergence analysis for a general class of probability flow ODE samplers in 2-Wasserstein distance, assuming accurate score estimates and smooth log-concave data distributions. We then consider various examples and establish results on the iteration complexity of the corresponding ODE-based samplers. Our proof technique relies on spelling out explicitly the contraction rate for the continuous-time ODE and analyzing the discretization and score-matching errors using synchronous coupling; the challenge in our analysis mainly arises from the inherent non-autonomy of the probability flow ODE and the specific exponential integrator that we study.
Forward citations
Cited by 9 Pith papers
-
Diffusion Bootstrap for High-Dimensional Linear Models
A diffusion pairs bootstrap recovers correct OLS variance in proportional high-dimensional linear models under score approximation, while terminal Wasserstein consistency alone does not.
-
A Sharp KL-Convergence Analysis for Diffusion Models under Minimal Assumptions
A new analysis shows O~(d/epsilon) steps suffice for KL-close diffusion sampling under only L2 score error and finite second moment assumptions, improving the known O~(d/epsilon^2).
-
Faster Diffusion Models via Higher-Order Approximation
A new higher-order ODE sampler for diffusion models is proven to reach ε total-variation accuracy with eO(d^{1+2/K}/ε^{1/K}) iterations under mild assumptions.
-
Assessing the Quality of Denoising Diffusion Models in Wasserstein Distance: Noisy Score and Optimal Bounds
Denoising diffusion models achieve Wasserstein-2 sampling error of order √D/K up to logarithmic factors for a broad class of distributions, matching the Gaussian lower bound, and score-evaluation noise vanishes as the...
-
Structured drift design for denoising diffusion models
Proposes GOU process with anisotropic drift to embed data geometry in diffusion models, claiming better mode separation, correlation preservation, and convergence than isotropic baselines.
-
Fast Convergence for High-Order ODE Solvers in Diffusion Probabilistic Models
A TV convergence bound O(d^{7/4} ε^{1/2} + d(dH)^p) is proved for p-th order (exponential) Runge-Kutta samplers of probability-flow ODEs under C² smoothness of the learned score.
-
A Unified Kullback--Leibler Divergence Analysis of Generative Diffusion Models via Entropy Production Rate
Diffusion model generation error is decomposed through an entropy-production-rate identity that claims O(h²) Euler–Maruyama KL bounds and unifies score SDE, PF-ODE, flow matching, and stochastic interpolant analyses.
-
Diffusion enabled Optimal Transport distances for graph matching
Diffusing node features before semi-relaxed fused Gromov–Wasserstein matching improves synthetic graph alignment accuracy and ARI over plain srFGW, most under medium noise.
-
Non-asymptotic convergence bound of conditional diffusion models
CARD's generated conditional distribution is shown to converge in Wasserstein distance to the true conditional distribution, with a separate score-estimation error bound controlled by network resolution and distributi...
Discussion (0). Sign in to comment.