On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms.
Tianyi LinNhat HoMichael I. JordanPublished in: ICML (2019)
Keyphrases
- complexity analysis
- computationally intensive
- computationally efficient
- highly scalable
- dynamic programming
- locally optimal
- computationally expensive
- optimal solution
- exhaustive search
- greedy heuristic
- efficient implementation
- statistical analysis
- orders of magnitude
- theoretical analysis
- recently developed
- worst case
- computational cost
- computational complexity
- computationally complex
- machine learning
- learning algorithm
- greedy algorithms
- approximately optimal
- efficient solutions
- highly efficient
- greedy algorithm
- times faster
- objective function
- feature selection