mlsanityData to 7 Oct 2026

Plug-in estimation of Schr"odinger bridges

arXiv 2408.11686 ↗First posted 21 Aug 2024stat.ML cs.LG math.OCcited by 8

Not on the map. Why?

Abstract (arXiv)

We propose a procedure for estimating the Schr"odinger bridge between two probability distributions. Unlike existing approaches, our method does not require iteratively simulating forward and backward diffusions or training neural networks to fit unknown drifts. Instead, we show that the potentials obtained from solving the static entropic optimal transport problem between the source and target samples can be modified to yield a natural plug-in estimator of the time-dependent drift that defines the bridge between two measures. Under minimal assumptions, we show that our proposal, which we call the Sinkhorn bridge, provably estimates the Schr"odinger bridge with a rate of convergence that depends on the intrinsic dimensionality of the target measure. Our approach combines results from the areas of sampling, and theoretical and statistical entropic optimal transport.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 49 of its 86 references that are in the map. First posted on arXiv 21 Aug 2024.

Builds on

49 of 86 references.

References · 49

  1. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2022Flow Matching for Generative Modelingcited by 5,426
  4. 2018Neural Ordinary Differential Equationscited by 3,733
  5. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
  6. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  7. 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
  8. 2018Computational Optimal Transportcited by 765
  9. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  10. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 440
  11. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
  12. 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 224
37 more
  1. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  2. 2021Likelihood Training of Schr"odinger Bridge using Forward-Backward SDEs Theorycited by 216
  3. 2023SE(3) diffusion model with application to protein backbone generationcited by 214
  4. 2022Convergence of score-based generative modeling for general data distributionscited by 179
  5. 2023The probability flow ODE is provably fastcited by 145
  6. 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
  7. 2018Improving GANs Using Optimal Transportcited by 122
  8. 2014On the relation between optimal transport and Schr"odinger bridges: A stochastic control viewpointcited by 99
  9. 2021Entropic estimation of optimal transport mapscited by 87
  10. 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
  11. 2020Faster Wasserstein Distance Estimation with the Sinkhorn Divergencecited by 73
  12. 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
  13. 2022The Schr"odinger Bridge between Gaussian Measures has a Closed Formcited by 63
  14. 2024Probabilistic Forecasting with Stochastic Interpolants and F"ollmer Processescited by 61
  15. 2024Optimal score estimation via empirical Bayes smoothingcited by 60
  16. 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 59
  17. 2022Conditional Simulation Using Diffusion Schr"odinger Bridgescited by 58
  18. 2021Bayesian Learning via Neural Schr"odinger-F"ollmer Flowscited by 56
  19. 2024Statistical optimal transportcited by 44
  20. 2021Towards a mathematical theory of trajectory inferencecited by 31
  21. 2021Entropic Optimal Transport: Convergence of Potentialscited by 30
  22. 2022Trajectory Inference via Mean-field Langevin in Path Spacecited by 29
  23. 2021Stability of Entropic Optimal Transport and Schr"odinger Bridgescited by 25
  24. 2023Energy-guided Entropic Neural Optimal Transportcited by 25
  25. 2022Optimal transport map estimation in general function spacescited by 20
  26. 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete casecited by 20
  27. 2023Building the Bridge of Schr"odinger: A Continuous Entropic Optimal Transport Benchmarkcited by 19
  28. 2020Learning normalizing flows from Entropy-Kantorovich potentialscited by 18
  29. 2022An improved central limit theorem and fast convergence rates for entropic transportation costscited by 18
  30. 2019Schr"odinger Bridge Samplerscited by 14
  31. 2021Asymptotics for semi-discrete entropic optimal transportcited by 14
  32. 2023Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginalscited by 13
  33. 2023Lower Complexity Adaptation for Empirical Entropic Optimal Transportcited by 12
  34. 2023Minimum intrinsic dimension scaling for entropic optimal transportcited by 11
  35. 2024Progressive Entropic Optimal Transport Solverscited by 10
  36. 2022Background Modeling for Double Higgs Boson Production: Density Ratios and Optimal Transportcited by 6
  37. 2023Estimation of entropy-regularized optimal transport maps between non-compactly supported measurescited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 3.

8 papers.