Approximation Rates for Schrödinger Bridge Potentials via Fixed-Point ERM

Denis Belomestny, Alexey Naumov, Nikita Puchkin, Denis Suchkov
Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence, PMLR 337:521-548, 2026.

Abstract

The Schrödinger bridge problem (SBP) provides a principled interpolation between two distributions by selecting, among all path measures matching given endpoint marginals, the one closest in relative entropy to a reference dynamics. In modern applications the marginals are observed only through samples, and standard computational pipelines solve a discretized SBP via {Sinkhorn} iterations and then heuristically extend the resulting dual potentials off-sample, entangling statistical, optimization, and smoothing errors. We study a learning-theoretic alternative based on a fixed-point characterization of a single \emph{transformed} Schrödinger potential $g^\star$, and we focus on quantitative approximation of $g^\star$ by a sample-based estimator $\widehat g$ that is continuous by construction. To address the intrinsic scaling ambiguity of Schrödinger potentials, we introduce a normalized, scale-invariant operator and analyze its local geometry around $g^\star$. Our main theoretical contribution is a stability result linking the error of the fixed-point residual to a distance to the solution $g^\star$ via analysis of spectral-gap property for the {Fréchet} derivative of the operator in a norm $\|\cdot\|$ being the sum of a localized {Hilbert} tangent seminorm and an $L^2$ distance. Combining this stability bound with the excess risk bounds and approximation error yields explicit non-asymptotic rates for $\|\widehat g-g^\star\|$. We illustrate performance of the suggested approach with numerical experiments.

Cite this Paper


BibTeX
@InProceedings{pmlr-v337-belomestny26a, title = {Approximation Rates for {Schrödinger} Bridge Potentials via Fixed-Point {ERM}}, author = {Belomestny, Denis and Naumov, Alexey and Puchkin, Nikita and Suchkov, Denis}, booktitle = {Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence}, pages = {521--548}, year = {2026}, editor = {Perković, Emilija and Malinsky, Daniel}, volume = {337}, series = {Proceedings of Machine Learning Research}, month = {17--21 Aug}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v337/main/assets/belomestny26a/belomestny26a.pdf}, url = {https://proceedings.mlr.press/v337/belomestny26a.html}, abstract = {The Schrödinger bridge problem (SBP) provides a principled interpolation between two distributions by selecting, among all path measures matching given endpoint marginals, the one closest in relative entropy to a reference dynamics. In modern applications the marginals are observed only through samples, and standard computational pipelines solve a discretized SBP via {Sinkhorn} iterations and then heuristically extend the resulting dual potentials off-sample, entangling statistical, optimization, and smoothing errors. We study a learning-theoretic alternative based on a fixed-point characterization of a single \emph{transformed} Schrödinger potential $g^\star$, and we focus on quantitative approximation of $g^\star$ by a sample-based estimator $\widehat g$ that is continuous by construction. To address the intrinsic scaling ambiguity of Schrödinger potentials, we introduce a normalized, scale-invariant operator and analyze its local geometry around $g^\star$. Our main theoretical contribution is a stability result linking the error of the fixed-point residual to a distance to the solution $g^\star$ via analysis of spectral-gap property for the {Fréchet} derivative of the operator in a norm $\|\cdot\|$ being the sum of a localized {Hilbert} tangent seminorm and an $L^2$ distance. Combining this stability bound with the excess risk bounds and approximation error yields explicit non-asymptotic rates for $\|\widehat g-g^\star\|$. We illustrate performance of the suggested approach with numerical experiments.} }
Endnote
%0 Conference Paper %T Approximation Rates for Schrödinger Bridge Potentials via Fixed-Point ERM %A Denis Belomestny %A Alexey Naumov %A Nikita Puchkin %A Denis Suchkov %B Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence %C Proceedings of Machine Learning Research %D 2026 %E Emilija Perković %E Daniel Malinsky %F pmlr-v337-belomestny26a %I PMLR %P 521--548 %U https://proceedings.mlr.press/v337/belomestny26a.html %V 337 %X The Schrödinger bridge problem (SBP) provides a principled interpolation between two distributions by selecting, among all path measures matching given endpoint marginals, the one closest in relative entropy to a reference dynamics. In modern applications the marginals are observed only through samples, and standard computational pipelines solve a discretized SBP via {Sinkhorn} iterations and then heuristically extend the resulting dual potentials off-sample, entangling statistical, optimization, and smoothing errors. We study a learning-theoretic alternative based on a fixed-point characterization of a single \emph{transformed} Schrödinger potential $g^\star$, and we focus on quantitative approximation of $g^\star$ by a sample-based estimator $\widehat g$ that is continuous by construction. To address the intrinsic scaling ambiguity of Schrödinger potentials, we introduce a normalized, scale-invariant operator and analyze its local geometry around $g^\star$. Our main theoretical contribution is a stability result linking the error of the fixed-point residual to a distance to the solution $g^\star$ via analysis of spectral-gap property for the {Fréchet} derivative of the operator in a norm $\|\cdot\|$ being the sum of a localized {Hilbert} tangent seminorm and an $L^2$ distance. Combining this stability bound with the excess risk bounds and approximation error yields explicit non-asymptotic rates for $\|\widehat g-g^\star\|$. We illustrate performance of the suggested approach with numerical experiments.
APA
Belomestny, D., Naumov, A., Puchkin, N. & Suchkov, D.. (2026). Approximation Rates for Schrödinger Bridge Potentials via Fixed-Point ERM. Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence, in Proceedings of Machine Learning Research 337:521-548 Available from https://proceedings.mlr.press/v337/belomestny26a.html.

Related Material