Pith. sign in

REVIEW 3 cited by

On the Trajectory Regularity of ODE-based Diffusion Sampling

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 2405.11326 v1 pith:A7CWVUUR submitted 2024-05-18 cs.LG cs.CV

classification cs.LGcs.CV
keywords trajectorysamplingode-baseddifferentialdiffusiondistributionequationsmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Diffusion-based generative models use stochastic differential equations (SDEs) and their equivalent ordinary differential equations (ODEs) to establish a smooth connection between a complex data distribution and a tractable prior distribution. In this paper, we identify several intriguing trajectory properties in the ODE-based sampling process of diffusion models. We characterize an implicit denoising trajectory and discuss its vital role in forming the coupled sampling trajectory with a strong shape regularity, regardless of the generated content. We also describe a dynamic programming-based scheme to make the time schedule in sampling better fit the underlying trajectory structure. This simple strategy requires minimal modification to any given ODE-based numerical solvers and incurs negligible computational cost, while delivering superior performance in image generation, especially in $5\sim 10$ function evaluations.

Discussion (0). Continue with ORCID 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. Amortized Moment Matching for Visual Generation

    cs.LG 2026-07 accept novelty 6.0 of 10

    Amortized Fréchet Distance uses neural nets to match conditional means and covariances, yielding stronger one-step visual generators than explicit FD-loss or multi-step teachers.

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

  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