Proves sharp O(1/k) rate for Sinkhorn via local bipartite graph analysis of positive-mass edges, bootstrapped from prior almost-sharp global bound.
arXiv preprint arXiv:1909.06918 , year=
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
Acc-Sinkhorn achieves O(1/k²) convergence for entropy-regularized OT via Hessian-driven Nesterov acceleration on a reduced dual objective, improving unregularized OT approximation to Õ(n²/ε) complexity.
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.
-
Accelerating Sinkhorn for Entropy-Regularized Optimal Transport
Acc-Sinkhorn achieves O(1/k²) convergence for entropy-regularized OT via Hessian-driven Nesterov acceleration on a reduced dual objective, improving unregularized OT approximation to Õ(n²/ε) complexity.