Pith. sign in

REVIEW 3 cited by

Provable Acceleration for Diffusion Models under Minimal Assumptions

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

arxiv 2410.23285 v3 pith:JNI2IS7I submitted 2024-10-30 cs.LG cs.AImath.OCstat.ML

classification cs.LGcs.AImath.OCstat.ML
keywords varepsilonaccelerationassumptionssamplersscorescore-baseddiffusiondistribution
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Score-based diffusion models, while achieving minimax optimality for sampling, are often hampered by slow sampling speeds due to the high computational burden of score function evaluations. Despite the recent remarkable empirical advances in speeding up the score-based samplers, theoretical understanding of acceleration techniques remains largely limited. To bridge this gap, we propose a novel training-free acceleration scheme for stochastic samplers. Under minimal assumptions -- namely, $L^2$-accurate score estimates and a finite second-moment condition on the target distribution -- our accelerated sampler provably achieves $\varepsilon$-accuracy in total variation within $\widetilde{O}(d^{5/4}/\sqrt{\varepsilon})$ iterations, thereby significantly improving upon the $\widetilde{O}(d/\varepsilon)$ iteration complexity of standard score-based samplers for $\varepsilon\leq 1/\sqrt{d}$. Notably, our convergence theory does not rely on restrictive assumptions on the target distribution or higher-order score estimation guarantees.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Exact simulation of diffusions and improved algorithms for log-concave sampling

    cs.DS 2026-08 conditional novelty 7.0 of 10

    Path-space rejection sampling with unbiased Girsanov ratio estimators yields log-concave samplers with O-tilde(kappa^{2/3} d^{1/3}) queries, improving prior kappa d^{1/2} MALA complexity.

  2. Faster Diffusion Models via Higher-Order Approximation

    cs.LG 2025-06 conditional novelty 7.0 of 10

    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.

  3. Non-asymptotic convergence bound of conditional diffusion models

    stat.ML 2025-08 conditional novelty 4.0 of 10

    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...

Pith tools