English

Schr\"odinger bridge problem via empirical risk minimization

Machine Learning 2026-02-10 v1 Machine Learning Probability Statistics Theory Statistics Theory

Abstract

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.

Keywords

Cite

@article{arxiv.2602.08374,
  title  = {Schr\"odinger bridge problem via empirical risk minimization},
  author = {Denis Belomestny and Alexey Naumov and Nikita Puchkin and Denis Suchkov},
  journal= {arXiv preprint arXiv:2602.08374},
  year   = {2026}
}
R2 v1 2026-07-01T10:27:26.870Z