Proves sharp O(1/k) rate for Sinkhorn via local bipartite graph analysis of positive-mass edges, bootstrapped from prior almost-sharp global bound.
Entropy minimization, DAD problems, and doubly stochastic kernels
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The Benamou-Brenier formula holds for the Schrödinger problem on sub-Gaussian probability measures via PDE estimates on potentials and entropic interpolation.
citing papers explorer
-
Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis
Proves sharp O(1/k) rate for Sinkhorn via local bipartite graph analysis of positive-mass edges, bootstrapped from prior almost-sharp global bound.
-
A PDE approach to Benamou--Brenier formula for the Schr\"odinger problem
The Benamou-Brenier formula holds for the Schrödinger problem on sub-Gaussian probability measures via PDE estimates on potentials and entropic interpolation.