Schr"odinger bridge problem via empirical risk minimization
Not on the map. Why?
Abstract (arXiv)
We study the Schr"odinger bridge problem when the endpoint distributions are available only through samples. Classical computational approaches estimate Schr"odinger potentials via Sinkhorn iterations on empirical measures and then construct a time-inhomogeneous drift by differentiating a kernel-smoothed dual solution. In contrast, we propose a learning-theoretic route: we rewrite the Schr"odinger system in terms of a single positive transformed potential that satisfies a nonlinear fixed-point equation and estimate this potential by empirical risk minimization over a function class. We establish uniform concentration of the empirical risk around its population counterpart under sub-Gaussian assumptions on the reference kernel and terminal density. We plug the learned potential into a stochastic control representation of the bridge to generate samples. We illustrate performance of the suggested approach with numerical experiments.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 19 references that are in the map. First posted on arXiv 9 Feb 2026.
Builds on
12 of 19 references.
References · 12
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
- 2018Computational Optimal Transportcited by 765
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
- 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
- 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
- 2015Entropic and displacement interpolation: a computational approach using the Hilbert metriccited by 34
- 2023Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginalscited by 13
- 2023Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approachcited by 7
- 2025Tight Bounds for Schr"odinger Potential Estimation in Unpaired Data Translationcited by 1
Built on by
Not cited yet.