English

Convergence Rates of the Regularized Optimal Transport : Disentangling Suboptimality and Entropy

Optimization and Control 2025-12-05 v3

Abstract

We study the convergence of the transport plans γϵ\gamma_\epsilon towards γ0\gamma_0 as well as the cost of the entropy-regularized optimal transport (c,γϵ)(c,\gamma_\epsilon) towards (c,γ0)(c,\gamma_0) as the regularization parameter ϵ\epsilon 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)W_2(\gamma_\epsilon,\gamma_0) is asymptotically greater than CϵC\sqrt{\epsilon} and the suboptimality (c,γϵ)(c,γ0)(c,\gamma_\epsilon)-(c,\gamma_0) is of order ϵ\epsilon. In the quadratic cost case the compactness assumption is relaxed into a moment of order 2+δ2+\delta assumption. Moreover, in the case of a Lipschitz transport map for the non-regularized problem, the distance W2(γϵ,γ0)W_2(\gamma_\epsilon,\gamma_0) converges to 00 at rate ϵ\sqrt{\epsilon}. Finally, if in addition the marginals have finite Fisher information, we prove (c,γϵ)(c,γ0)dϵ/2(c,\gamma_\epsilon)-(c,\gamma_0) \sim d\epsilon/2 and we provide a companion expansion of H(γϵ)H(\gamma_\epsilon). These results are achieved by disentangling the role of the cost and the entropy in the regularized problem.

Keywords

Cite

@article{arxiv.2306.06940,
  title  = {Convergence Rates of the Regularized Optimal Transport : Disentangling Suboptimality and Entropy},
  author = {Hugo Malamut and Maxime Sylvestre},
  journal= {arXiv preprint arXiv:2306.06940},
  year   = {2025}
}