Pith. sign in

REVIEW 3 cited by

Fast Diffusion Probabilistic Model Sampling through the lens of Backward Error Analysis

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 2304.11446 v1 pith:2KXCNHHS submitted 2023-04-22 cs.CV cs.AI

classification cs.CVcs.AI
keywords ddpmsdiffusionsamplingbackwarderrorevaluationsfastfunction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Denoising diffusion probabilistic models (DDPMs) are a class of powerful generative models. The past few years have witnessed the great success of DDPMs in generating high-fidelity samples. A significant limitation of the DDPMs is the slow sampling procedure. DDPMs generally need hundreds or thousands of sequential function evaluations (steps) of neural networks to generate a sample. This paper aims to develop a fast sampling method for DDPMs requiring much fewer steps while retaining high sample quality. The inference process of DDPMs approximates solving the corresponding diffusion ordinary differential equations (diffusion ODEs) in the continuous limit. This work analyzes how the backward error affects the diffusion ODEs and the sample quality in DDPMs. We propose fast sampling through the \textbf{Restricting Backward Error schedule (RBE schedule)} based on dynamically moderating the long-time backward error. Our method accelerates DDPMs without any further training. Our experiments show that sampling with an RBE schedule generates high-quality samples within only 8 to 20 function evaluations on various benchmark datasets. We achieved 12.01 FID in 8 function evaluations on the ImageNet $128\times128$, and a $20\times$ speedup compared with previous baseline samplers.

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. Differentiable Solver Search for Fast Diffusion Sampling

    cs.CV 2025-05 conditional novelty 6.0 of 10

    A differentiable search over solver coefficients and sampling timesteps produces a fast diffusion sampler that outperforms DPM-Solver++ and UniPC at 5 to 10 steps.

  2. A Unified Kullback--Leibler Divergence Analysis of Generative Diffusion Models via Entropy Production Rate

    math.NA 2026-08 conditional novelty 5.0 of 10

    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.

  3. Unleashing High-Quality Image Generation in Diffusion Sampling Using Second-Order Levenberg-Marquardt-Langevin

    cs.CV 2025-05 reject novelty 5.0 of 10

    A training-free 'Levenberg-Marquardt-Langevin' diffusion sampler is claimed to improve image FID, but its update rule collapses to that of the baseline DPM-Solver for the parameter values used in the paper.

Pith tools