Statistical Analysis of the Sinkhorn Iterations for Two-Sample Schr\"odinger Bridge Estimation
Ibuki Maeda, Rentian Yao, Atsushi Nitanda

TL;DR
This paper provides a theoretical analysis of the statistical performance of Sinkhorn iterations in estimating Schr"odinger bridges from finite samples, offering bounds that guide practical parameter choices.
Contribution
It establishes a novel statistical bound on Sinkhorn bridge iterations in the two-sample setting, connecting various estimators and justifying their finite-sample performance.
Findings
Bound on total variation error: O(1/m + 1/n + r^{4k})
Theoretical guarantees for finite-sample Schr"odinger bridge estimation
Connection between multiple Schr"odinger bridge estimators
Abstract
The Schr\"odinger bridge problem seeks the optimal stochastic process that connects two given probability distributions with minimal energy modification. While the Sinkhorn algorithm is widely used to solve the static optimal transport problem, a recent work (Pooladian and Niles-Weed, 2024) proposed the Sinkhorn bridge, which estimates Schr\"odinger bridges by plugging optimal transport into the time-dependent drifts of SDEs, with statistical guarantees in the one-sample estimation setting where the true source distribution is fully accessible. In this work, to further justify this method, we study the statistical performance of intermediate Sinkhorn iterations in the two-sample estimation setting, where only finite samples from both source and target distributions are available. Specifically, we establish a statistical bound on the squared total variation error of Sinkhorn bridge…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
