Plug-in estimation of Schr"odinger bridges
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
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
- 2018Computational Optimal Transportcited by 765
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
- 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 440
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 224
37 more
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
- 2021Likelihood Training of Schr"odinger Bridge using Forward-Backward SDEs Theorycited by 216
- 2023SE(3) diffusion model with application to protein backbone generationcited by 214
- 2022Convergence of score-based generative modeling for general data distributionscited by 179
- 2023The probability flow ODE is provably fastcited by 145
- 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
- 2018Improving GANs Using Optimal Transportcited by 122
- 2014On the relation between optimal transport and Schr"odinger bridges: A stochastic control viewpointcited by 99
- 2021Entropic estimation of optimal transport mapscited by 87
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2020Faster Wasserstein Distance Estimation with the Sinkhorn Divergencecited by 73
- 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
- 2022The Schr"odinger Bridge between Gaussian Measures has a Closed Formcited by 63
- 2024Probabilistic Forecasting with Stochastic Interpolants and F"ollmer Processescited by 61
- 2024Optimal score estimation via empirical Bayes smoothingcited by 60
- 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 59
- 2022Conditional Simulation Using Diffusion Schr"odinger Bridgescited by 58
- 2021Bayesian Learning via Neural Schr"odinger-F"ollmer Flowscited by 56
- 2024Statistical optimal transportcited by 44
- 2021Towards a mathematical theory of trajectory inferencecited by 31
- 2021Entropic Optimal Transport: Convergence of Potentialscited by 30
- 2022Trajectory Inference via Mean-field Langevin in Path Spacecited by 29
- 2021Stability of Entropic Optimal Transport and Schr"odinger Bridgescited by 25
- 2023Energy-guided Entropic Neural Optimal Transportcited by 25
- 2022Optimal transport map estimation in general function spacescited by 20
- 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete casecited by 20
- 2023Building the Bridge of Schr"odinger: A Continuous Entropic Optimal Transport Benchmarkcited by 19
- 2020Learning normalizing flows from Entropy-Kantorovich potentialscited by 18
- 2022An improved central limit theorem and fast convergence rates for entropic transportation costscited by 18
- 2019Schr"odinger Bridge Samplerscited by 14
- 2021Asymptotics for semi-discrete entropic optimal transportcited by 14
- 2023Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginalscited by 13
- 2023Lower Complexity Adaptation for Empirical Entropic Optimal Transportcited by 12
- 2023Minimum intrinsic dimension scaling for entropic optimal transportcited by 11
- 2024Progressive Entropic Optimal Transport Solverscited by 10
- 2022Background Modeling for Double Higgs Boson Production: Density Ratios and Optimal Transportcited by 6
- 2023Estimation of entropy-regularized optimal transport maps between non-compactly supported measurescited by 2
Built on by
Citing papers per year: 2025: 5; 2026: 3.
8 papers.
- 2025Curly Flow Matching for Learning Non-gradient Field Dynamicscited by 17
- 2025Integrating Dynamical Systems Modeling with Spatiotemporal scRNA-seq Data Analysiscited by 9
- 2025Forward Reverse Kernel Regression for the Schr"odinger bridge problemcited by 1
- 2026Variational Optimality of F"ollmer Processes in Generative Diffusionscited by 1
- 2025E-ROBOT: a dimension-free method for robust statistics and machine learning via Schr"odinger bridgecited by 0
- 2025Statistical Analysis of the Sinkhorn Iterations for Two-Sample Schr"odinger Bridge Estimationcited by 0
- 2026Direct Estimation of Schr"odinger Bridge Time-Series Drifts: Finite-Sample, Asymptotic, and Adaptive Guaranteescited by 0
- 2026Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parametercited by 0
- 2026Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter29 Aug 2026
- 2026Direct Estimation of Schr"odinger Bridge Time-Series Drifts: Finite-Sample, Asymptotic, and Adaptive Guarantees6 May 2026
- 2026Variational Optimality of F"ollmer Processes in Generative Diffusions11 Feb 2026
- 2025Curly Flow Matching for Learning Non-gradient Field Dynamics30 Oct 2025
- 2025Statistical Analysis of the Sinkhorn Iterations for Two-Sample Schr"odinger Bridge Estimation26 Oct 2025
- 2025E-ROBOT: a dimension-free method for robust statistics and machine learning via Schr"odinger bridge15 Sep 2025
- 2025Forward Reverse Kernel Regression for the Schr"odinger bridge problem1 Jul 2025
- 2025Integrating Dynamical Systems Modeling with Spatiotemporal scRNA-seq Data Analysis14 Mar 2025