mlsanityData to 7 Oct 2026

Transport with Support: Data-Conditional Diffusion Bridges

arXiv 2301.13636 ↗First posted 31 Jan 2023cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

The dynamic Schr"odinger bridge problem provides an appealing setting for solving constrained time-series data generation tasks posed as optimal transport problems. It consists of learning non-linear diffusion processes using efficient iterative solvers. Recent works have demonstrated state-of-the-art results (eg. in modelling single-cell embryo RNA sequences or sampling from complex posteriors) but are limited to learning bridges with only initial and terminal constraints. Our work extends this paradigm by proposing the Iterative Smoothing Bridge (ISB). We integrate Bayesian filtering and optimal control into learning the diffusion process, enabling the generation of constrained stochastic processes governed by sparse observations at intermediate stages and terminal constraints. We assess the effectiveness of our method on synthetic and real-world data generation tasks and we show that the ISB generalises well to high-dimensional data, is computationally efficient, and provides accurate estimates of the marginals at intermediate and terminal times.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 29 of its 69 references that are in the map. First posted on arXiv 31 Jan 2023.

Builds on

29 of 69 references.

References · 29

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,185
  4. 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,736
  5. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  6. 2022Planning with Diffusion for Flexible Behavior Synthesiscited by 1,023
  7. 2018Computational Optimal Transportcited by 765
  8. 2021Maximum Likelihood Training of Score-Based Diffusion Modelscited by 670
  9. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  10. 2021CSDI: Conditional Score-based Diffusion Models for Probabilistic Time Series Imputationcited by 577
  11. 2021Solving Inverse Problems in Medical Imaging with Score-Based Generative Modelscited by 514
  12. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
17 more
  1. 2020Scalable Gradients for Stochastic Differential Equationscited by 264
  2. 2021Likelihood Training of Schr"odinger Bridge using Forward-Backward SDEs Theorycited by 216
  3. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
  4. 2022An optimal control perspective on diffusion-based generative modelingcited by 145
  5. 2020Multivariate Probabilistic Time Series Forecasting via Conditioned Normalizing Flowscited by 142
  6. 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
  7. 2021Deep Generative Learning via Schr"odinger Bridgecited by 103
  8. 2020Interacting particle solutions of Fokker-Planck equations through gradient-log-density estimationcited by 87
  9. 2021Differentiable Particle Filtering via Entropy-Regularized Optimal Transportcited by 59
  10. 2022Conditional Simulation Using Diffusion Schr"odinger Bridgescited by 58
  11. 2022Score-Based Diffusion meets Annealed Importance Samplingcited by 51
  12. 2019Wasserstein Proximal Algorithms for the Schr"odinger Bridge Problem: Density Control with Nonlinear Driftcited by 50
  13. 2022Deep Generalized Schr"odinger Bridgecited by 47
  14. 2020Reflected Schr"odinger Bridge: Density Control with Path Constraintscited by 22
  15. 2016A flexible state space model for learning nonlinear dynamical systemscited by 18
  16. 2021Deterministic particle flows for constraining stochastic nonlinear systemscited by 8
  17. 2022Neural Stochastic Controlcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 6; 2024: 1; 2025: 1; 2026: 1.

9 papers.