Lénaïc Chizat, Tomas Vaskevicius
We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, mu, admits a density over R-d. For a semi-concave cost function bounded by cand a regularization ...
SPRINGER HEIDELBERG2025