57 citations · 432 across the 81 of their papers we have counts for
Showing 2019 · cs.DSShow all
3 papers · 2 filters
cs.DS2019★ 5 cited
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport
Tianyi Lin, Nhat Ho, Michael I. Jordan
We present several new complexity results for the entropic regularized algorithms that approximately solve the optimal transport (OT) problem between two discrete probability measu…
cs.DS2019★ 8 cited
Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter
Wenshuo Guo, Nhat Ho, Michael I. Jordan
We provide theoretical complexity analysis for new algorithms to compute the optimal transport (OT) distance between two discrete probability distributions, and demonstrate their f…
cs.DS2019★ 57 cited
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
Tianyi Lin, Nhat Ho, Michael I. Jordan
We provide theoretical analyses for two algorithms that solve the regularized optimal transport (OT) problem between two discrete probability measures with at most atoms. We sh…