REVIEW 3 cited by
Minimax Optimality of the Probability Flow ODE for Diffusion Models
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
abstract
Score-based diffusion models have become a foundational paradigm for modern generative modeling, demonstrating exceptional capability in generating samples from complex high-dimensional distributions. Despite the dominant adoption of probability flow ODE-based samplers in practice due to their superior sampling efficiency and precision, rigorous statistical guarantees for these methods have remained elusive in the literature. This work develops the first end-to-end theoretical framework for deterministic ODE-based samplers that establishes near-minimax optimal guarantees under mild assumptions on target data distributions. Specifically, focusing on subgaussian distributions with $\beta$-H\"older smooth densities for $\beta\leq 2$, we propose a smooth regularized score estimator that simultaneously controls both the $L^2$ score error and the associated mean Jacobian error. Leveraging this estimator within a refined convergence analysis of the ODE-based sampling process, we demonstrate that the resulting sampler achieves the minimax rate in total variation distance, modulo logarithmic factors. Notably, our theory comprehensively accounts for all sources of error in the sampling process and does not require strong structural conditions such as density lower bounds or Lipschitz/smooth scores on target distributions, thereby covering a broad range of practical data distributions.
Forward citations
Cited by 3 Pith papers
-
Fast Score-Based Sampling via Log-Concave Reductions
Score-based sampling reduces to a short sequence of strongly log-concave sampling problems, giving √d polylog(1/ε) complexity bounds and logarithmic dependence on the condition number for log-concave targets.
-
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.
-
Provable diffusion-based posterior sampling for linear inverse problems via DDIM
A SVD-based, coordinate-wise DDIM sampler is claimed to asymptotically sample from the posterior for noisy linear inverse problems, but the proof's posterior identification step does not follow from the stated updates.
Discussion (0). Continue with ORCID to comment.