A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings.
Nathaniel LahnSharath RaghvendraKaiyi ZhangPublished in: NeurIPS (2023)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- preprocessing
- worst case
- k means
- significant improvement
- matching algorithm
- detection algorithm
- objective function
- search space
- parallel implementation
- optimization algorithm
- computational complexity
- segmentation algorithm
- theoretical analysis
- globally optimal
- expectation maximization
- np hard
- cost function
- depth first search
- locally optimal
- convergence rate
- computationally efficient
- upper bound
- similarity measure