Pith. sign in

REVIEW 1 cited by

Distributional Diffusion Models with Scoring Rules

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 2502.02483 v3 pith:KT6DH7YV submitted 2025-02-04 cs.LG stat.ML

classification cs.LGstat.ML
keywords dataprocesssamplediffusiondistributionmodelsreversediscretization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Diffusion models generate high-quality synthetic data. They operate by defining a continuous-time forward process which gradually adds Gaussian noise to data until fully corrupted. The corresponding reverse process progressively "denoises" a Gaussian sample into a sample from the data distribution. However, generating high-quality outputs requires many discretization steps to obtain a faithful approximation of the reverse process. This is expensive and has motivated the development of many acceleration methods. We propose to accomplish sample generation by learning the posterior {\em distribution} of clean data samples given their noisy versions, instead of only the mean of this distribution. This allows us to sample from the probability transitions of the reverse process on a coarse time scale, significantly accelerating inference with minimal degradation of the quality of the output. This is accomplished by replacing the standard regression loss used to estimate conditional means with a scoring rule. We validate our method on image and robot trajectory generation, where we consistently outperform standard diffusion models at few discretization steps.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Generative Modeling via Kernelized Stochastic Interpolants

    cs.LG 2026-02 conditional novelty 6.0 of 10

    The drift of a stochastic interpolant is estimated by solving a P×P linear system from feature gradients, enabling training-free generation and training-free combination of pretrained generative models.

Pith tools