Convergence Rates of the Regularized Optimal Transport : Disentangling Suboptimality and Entropy
Abstract
We study the convergence of the transport plans towards as well as the cost of the entropy-regularized optimal transport towards 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 is asymptotically greater than and the suboptimality is of order . In the quadratic cost case the compactness assumption is relaxed into a moment of order assumption. Moreover, in the case of a Lipschitz transport map for the non-regularized problem, the distance converges to at rate . Finally, if in addition the marginals have finite Fisher information, we prove and we provide a companion expansion of . 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}
}