REVIEW 16 cited by
Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localization
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
Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localization
read the original abstract
Denoising diffusions are a powerful method to generate approximate samples from high-dimensional data distributions. Recent results provide polynomial bounds on their convergence rate, assuming $L^2$-accurate scores. Until now, the tightest bounds were either superlinear in the data dimension or required strong smoothness assumptions. We provide the first convergence bounds which are linear in the data dimension (up to logarithmic factors) assuming only finite second moments of the data distribution. We show that diffusion models require at most $\tilde O(\frac{d \log^2(1/\delta)}{\varepsilon^2})$ steps to approximate an arbitrary distribution on $\mathbb{R}^d$ corrupted with Gaussian noise of variance $\delta$ to within $\varepsilon^2$ in KL divergence. Our proof extends the Girsanov-based methods of previous works. We introduce a refined treatment of the error from discretizing the reverse SDE inspired by stochastic localization.
Forward citations
Cited by 16 Pith papers
-
Weak Poincar\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model
Approximate stochastic localization plus conductance transfers yield a weak Poincaré inequality for the SK model at β < 1/2, enabling efficient Glauber sampling from a warm start.
-
Adaptive Order Policies for Masked Diffusion
A policy network learns to choose unmasking order in masked diffusion by reweighting the loss, outperforming random and heuristic baselines on ordering-sensitive tasks.
-
Proximal-Based Generative Modeling for Bayesian Inverse Problems
PGM framework links diffusion to proximal regularization for closed-form Moreau-score sampling in Bayesian inverse problems, learned only from prior samples.
-
Proximal-Based Generative Modeling for Bayesian Inverse Problems
PGM replaces the intractable likelihood score in diffusion models with a closed-form Moreau score computed via proximal operators, enabling non-asymptotic sampling for inverse problems trained only on prior data.
-
Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
A polynomial-time algorithm samples the SK model Gibbs measure with o(1) TVD error for β < 1/2 by combining potential Hessian ascent, stochastic localization, Jarzynski equality, and Glauber dynamics.
-
Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
Polynomial-time algorithm samples the Sherrington-Kirkpatrick Gibbs measure at beta < 1/2 with o(1) TVD error by combining potential Hessian ascent, stochastic localization, covariance estimates, and Jarzynski equalit...
-
Discrete Stochastic Localization for Non-autoregressive Generation
Discrete Stochastic Localization lets a single trained network support an entire family of per-token SNR paths for discrete sequence generation, with masked diffusion as a special case, and improves MAUVE scores when ...
-
Generative Modeling from Black-box Corruptions via Self-Consistent Stochastic Interpolants
SCSI iteratively refines a self-consistent transport map to invert black-box corruptions and enable generative modeling of clean data.
-
Diffusion Models Adapt to Low-Dimensional Structure Under Flexible Coefficient Choices
For a broad class of coefficients, diffusion models achieve Õ(k/ε) iteration complexity for ε-accurate TV sampling under low-dimensional structure, independent of ambient dimension.
-
Guided Flow Matching for Forward and Inverse PDE Problems with Sparse Observations: Algorithm and Theory
FM4PDE applies flow matching to learn joint PDE coefficient-solution distributions, using guided sampling with composite losses for forward and inverse problems and providing error guarantees under stated assumptions.
-
Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine
SiLD is a score-matching framework that learns both manifold projection and intrinsic density from a single objective, with proven sample complexity depending only on intrinsic dimension.
-
Energy Generative Modeling: A Lyapunov-based Energy Matching Perspective
Training and sampling in static scalar energy generative models are two instances of the same Lyapunov-driven density transport dynamics on Wasserstein space, differing only by initial condition, which yields a finite...
-
Generating DDPM-based Samples from Tilted Distributions
A plug-in estimator for tilted distributions is minimax-optimal, with Wasserstein closeness bounds to the true tilted distribution and TV-accuracy guarantees when running diffusion on the estimated samples.
-
Diffusion Model for Manifold Data: Score Decomposition, Curvature, and Statistical Complexity
Diffusion models on manifold-supported data admit score decompositions whose statistical rates are controlled by intrinsic dimension and curvature.
-
HYVINT: Intensity-Driven Hypergraph Generation with Variational Representations
HYVINT introduces an intensity-driven incidence mechanism and tractable variational estimator for hypergraph generation, with error bounds and empirical gains in fidelity, novelty, and diversity.
-
A Mathematical Introduction to Diffusion Models
An educational exposition that layers core definitions, simplified estimates, and research-level theorems on diffusion sampling for probability-background graduate students.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.