Establishes the first non-asymptotic exponential convergence rates for Sinkhorn's algorithm on unbounded quadratic costs with non-compact marginals satisfying asymptotically positive log-concavity.
Foundations of Modern Probability, volume 293 of Probability Theory and Stochastic Modelling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginals
Establishes the first non-asymptotic exponential convergence rates for Sinkhorn's algorithm on unbounded quadratic costs with non-compact marginals satisfying asymptotically positive log-concavity.