ASPOT achieves O(n^{7/3} ε^{-5/3}) complexity for partial optimal transport via Nesterov-accelerated alternating minimization, plus an improved gamma choice for classical Sinkhorn.
Computational optimal transport: Com- plexity by accelerated gradient descent is better than by sinkhorn’s algorithm,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Accelerated Sinkhorn Algorithms for Partial Optimal Transport
ASPOT achieves O(n^{7/3} ε^{-5/3}) complexity for partial optimal transport via Nesterov-accelerated alternating minimization, plus an improved gamma choice for classical Sinkhorn.