On the Acceleration of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport
share
We propose and analyze a novel approach to accelerate the Sinkhorn and Greenkhorn algorithms for solving the entropic regularized optimal transport (OT) problems. Focusing on the discrete setting where the probability distributions have at most n atoms, and letting ε∈(0, 1) denote the tolerance, we introduce accelerated algorithms that have complexity bounds of O(n^5/2/ε^3/2). This improves on the known complexity bound of O(n^2/ε^2) for the Sinkhorn and Greenkhorn algorithms. We also present two hybrid algorithms that use the new accelerated algorithms to initialize the Sinkhorn and Greenkhorn algorithms, and we establish complexity bounds of O(n^7/3/ε) for these hybrid algorithms. This is better than the best known complexity O(n^5/2/ε) for accelerated gradient-type algorithms for entropic regularized OT in the literature. We provide an extensive experimental comparison on both synthetic and real datasets to explore the relative advantages of the new algorithms.
READ FULL TEXT