Convergence Rates of the Regularized Optimal Transport : Disentangling Suboptimality and Entropy
Not on the map. Why?
Abstract (arXiv)
We study the convergence of the transport plans γε towards γ0 as well as the cost of the entropy-regularized optimal transport (c,γε) towards (c,γ0) as the regularization parameter ε vanishes in the setting of finite entropy marginals. We show that under the assumption of infinitesimally twisted cost and compactly supported marginals the distance W2(γε,γ0) is asymptotically greater than C√ε and the suboptimality (c,γε)-(c,γ0) is of order ε. In the quadratic cost case the compactness assumption is relaxed into a moment of order 2+δ assumption. Moreover, in the case of a Lipschitz transport map for the non-regularized problem, the distance W2(γε,γ0) converges to 0 at rate √ε. Finally, if in addition the marginals have finite Fisher information, we prove (c,γε)-(c,γ0) ~ dε/2 and we provide a companion expansion of H(γε). These results are achieved by disentangling the role of the cost and the entropy in the regularized problem.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2024Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasingcited by 6
- 2024A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithmcited by 4
- 2025Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavitycited by 0
- 2025E-ROBOT: a dimension-free method for robust statistics and machine learning via Schr"odinger bridgecited by 0
- 2025E-ROBOT: a dimension-free method for robust statistics and machine learning via Schr"odinger bridge15 Sep 2025
- 2025Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity15 Apr 2025
- 2024A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm12 Dec 2024
- 2024Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing21 Aug 2024