On the Efficiency of Sinkhorn and Greenkhorn and Their Acceleration for Optimal Transport

We present several new complexity results for the algorithms that approximately solve the optimal transport (OT) problem between two discrete probability measures with at most n atoms. First, we improve the complexity bound of a greedy variant of the Sinkhorn algorithm, known as Greenkhorn algorithm, from Õ(nε) to Õ(nε). Notably, this matches the best known complexity bound of the Sinkhorn algorithm and sheds the light to superior practical performance of the Greenkhorn algorithm. Second, we generalize an adaptive primal-dual accelerated gradient descent (APDAGD) algorithm [Dvurechensky et al., 2018] with mirror mapping φ and prove that the resulting APDAMD algorithm achieves the complexity bound of Õ(n √ δε) where δ > 0 refers to the regularity of φ. We demonstrate that the complexity bound of Õ(min{n9/4ε−1, n2ε−2}) is invalid for the APDAGD algorithm and establish a new complexity bound of Õ(nε). Moreover, we propose a deterministic accelerated Sinkhorn algorithm and prove that it achieves the complexity bound of Õ(nε) by incorporating an estimate sequence. Therefore, the accelerated Sinkhorn algorithm outperforms the Sinkhorn and Greenkhorn algorithms in terms of 1/ε and the APDAGD and accelerated alternating minimization [Guminov et al., 2021] algorithms in terms of n. Finally, we conduct experiments on synthetic data and real images with the proposed algorithms in the paper and demonstrate their efficiency via numerical results.