34 citations · 56 across the 7 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024
Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings
Lénaïc Chizat, Alex Delalande, Tomas Vaškevičius
We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, , admits a densit…
math.OC2023★ 1 cited
Computational Guarantees for Doubly Entropic Wasserstein Barycenters via Damped Sinkhorn Iterations
Lénaïc Chizat, Tomas Vaškevičius
We study the computation of doubly regularized Wasserstein barycenters, a recently introduced family of entropic barycenters governed by inner and outer regularization strengths. P…