Pith. sign in

REVIEW 4 cited by

Diffusion Schr\"odinger Bridge with Applications to Score-Based Generative Modeling

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 2106.01357 v5 pith:WU7HBQ5K submitted 2021-06-01 stat.ML cs.LGmath.PR

classification stat.MLcs.LGmath.PR
keywords generativetimedatadistributiongaussianmodelingproblemapproximately
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Progressively applying Gaussian noise transforms complex data distributions to approximately Gaussian. Reversing this dynamic defines a generative model. When the forward noising process is given by a Stochastic Differential Equation (SDE), Song et al. (2021) demonstrate how the time inhomogeneous drift of the associated reverse-time SDE may be estimated using score-matching. A limitation of this approach is that the forward-time SDE must be run for a sufficiently long time for the final distribution to be approximately Gaussian. In contrast, solving the Schr\"odinger Bridge problem (SB), i.e. an entropy-regularized optimal transport problem on path spaces, yields diffusions which generate samples from the data distribution in finite time. We present Diffusion SB (DSB), an original approximation of the Iterative Proportional Fitting (IPF) procedure to solve the SB problem, and provide theoretical analysis along with generative modeling experiments. The first DSB iteration recovers the methodology proposed by Song et al. (2021), with the flexibility of using shorter time intervals, as subsequent DSB iterations reduce the discrepancy between the final-time marginal of the forward (resp. backward) SDE with respect to the prior (resp. data) distribution. Beyond generative modeling, DSB offers a widely applicable computational optimal transport tool as the continuous state-space analogue of the popular Sinkhorn algorithm (Cuturi, 2013).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Learning Backward Transport for Source Localization

    physics.flu-dyn 2026-07 conditional novelty 7.0 of 10

    Source localization reduces to Langevin sampling of a learned backward tracer propagator, unifying chemotaxis and cast-and-surge and beating classical heuristics across wind regimes in 2D turbulence.

  2. Spectral Diffusion for Protein Dynamics

    q-bio.BM 2026-07 conditional novelty 6.5 of 10

    Diffusion over DCT spectral volumes of Cα displacements yields fast, temperature-conditioned protein trajectories with RMSF Pearson r of 0.844 on held-out mdCATH.

  3. Multi-marginal temporal Schr\"odinger Bridge Matching from unpaired data

    cs.LG 2025-10 reject novelty 5.0 of 10

    MMtSBM extends diffusion Schrödinger bridge matching to multiple time marginals via a factorized iterative Markovian fitting algorithm, claiming state-of-the-art trajectory inference and video generation from unpaired data.

  4. Optical Physics-Based Generative Models

    physics.optics 2025-06 reject novelty 4.0 of 10

    Optical wave equations are claimed to work as generative models with big efficiency gains, but the derivations contain algebraic sign errors and the reported FID scores are mutually inconsistent.

Pith tools