On the geometry and dynamical formulation of the Sinkhorn algorithm for optimal transport.
Klas ModinPublished in: CoRR (2023)
Keyphrases
- optimal solution
- dynamic programming
- optimization algorithm
- detection algorithm
- times faster
- worst case
- computational cost
- experimental evaluation
- cost function
- simulated annealing
- learning algorithm
- theoretical analysis
- computational complexity
- globally optimal
- optimal strategy
- optimality criterion
- exhaustive search
- probabilistic formulation
- computationally efficient
- neural network
- k means
- search space
- three dimensional
- closed form
- expectation maximization
- convex hull
- convergence rate
- linear programming
- significant improvement
- iterative procedure
- locally optimal
- lp norm