REVIEW 6 cited by
Contractive Diffusion Probabilistic 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
Diffusion probabilistic models (DPMs) have emerged as a promising technique in generative modeling. The success of DPMs relies on two ingredients: time reversal of diffusion processes and score matching. In view of possibly unguaranteed score matching, we propose a new criterion -- the contraction property of backward sampling in the design of DPMs, leading to a novel class of contractive DPMs (CDPMs). Our key insight is that, the contraction property can provably narrow score matching errors and discretization errors, thus our proposed CDPMs are robust to both sources of error. For practical use, we show that CDPM can leverage weights of pretrained DPMs by a simple transformation, and does not need retraining. We corroborated our approach by experiments on synthetic 1-dim examples, Swiss Roll, MNIST, CIFAR-10 32$\times$32 and AFHQ 64$\times$64 dataset. Notably, CDPM steadily improves the performance of baseline score-based diffusion models.
Forward citations
Cited by 6 Pith papers
-
Score Accuracy Along the Forward Diffusion Does Not Certify Numerical Stability in Diffusion Sampling
Small forward-marginal score error does not guarantee stable diffusion sampling because rare numerical trajectories can enter poorly controlled regions and trigger superlinear amplification.
-
From Score Learning to Discretized Sampling: An End-to-End Generalization Analysis of Diffusion Models
An end-to-end TV bound for score-based diffusion models that decomposes generative error into forward truncation, reverse discretization, finite-sample generalization, and optimization gap.
-
Tightening the Score Matching Gap for Diffusion Models
Tighter score-matching gap bounds for diffusion models via entropy flows, LSI and reflection couplings show that low-noise score accuracy dominates sample quality metrics.
-
Dynamic data generation and dynamic portfolio selection: an application of a score-based diffusion model
An adaptive score-based diffusion model generates sequential market scenarios with adapted-Wasserstein error bounds, and a policy-gradient agent trained on these scenarios outperforms several portfolio benchmarks.
-
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.
-
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.