On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms.
Tianyi LinNhat HoMichael I. JordanPublished in: CoRR (2019)
Keyphrases
- computationally efficient
- computationally complex
- recently developed
- efficient algorithms for computing
- exhaustive search
- data mining
- computationally expensive
- learning algorithm
- data structure
- dynamic programming
- worst case
- highly efficient
- greedy heuristic
- field of view
- greedy algorithm
- times faster
- data streams
- computational efficiency
- highly scalable
- efficient solutions
- computational cost
- computationally tractable
- greedy algorithms
- computationally demanding
- feature selection
- statistical analysis