Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm.
Pavel E. DvurechenskyAlexander V. GasnikovAlexey KroshninPublished in: CoRR (2018)
Keyphrases
- worst case
- cost function
- dynamic programming
- computational complexity
- optimal solution
- space complexity
- objective function
- memory requirements
- np hard
- matching algorithm
- detection algorithm
- computational cost
- linear complexity
- high accuracy
- preprocessing
- convergence rate
- learning algorithm
- globally optimal
- times faster
- path planning
- error tolerance
- experimental evaluation
- k means
- energy function
- theoretical analysis
- closed form
- computationally efficient
- denoising
- estimation error
- multi objective
- optimal strategy
- complexity analysis
- search space
- neural network