Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm.
Pavel E. DvurechenskyAlexander V. GasnikovAlexey KroshninPublished in: ICML (2018)
Keyphrases
- worst case
- dynamic programming
- optimal solution
- computational complexity
- high accuracy
- globally optimal
- experimental evaluation
- search space
- times faster
- cost function
- complexity analysis
- computational cost
- matching algorithm
- preprocessing
- memory requirements
- detection algorithm
- space complexity
- learning algorithm
- theoretical analysis
- linear programming
- computationally efficient
- np hard
- objective function
- error tolerance
- linear complexity
- error function
- optimal parameters
- genetic algorithm
- similarity measure
- exhaustive search
- lower bound
- k means
- closed form
- path planning
- probabilistic model
- optimization algorithm