A note on overrelaxation in the Sinkhorn algorithm.
Tobias LehmannMax-K. von RenesseAlexander SambaleAndré UschmajewPublished in: CoRR (2020)
Keyphrases
- detection algorithm
- learning algorithm
- recognition algorithm
- k means
- np hard
- objective function
- computational complexity
- experimental evaluation
- optimization algorithm
- estimation algorithm
- improved algorithm
- convergence rate
- matching algorithm
- classification algorithm
- experimental study
- expectation maximization
- simulated annealing
- worst case
- linear programming
- computationally efficient
- theoretical analysis
- segmentation algorithm
- high accuracy
- probabilistic model
- tree structure
- computational cost
- cost function
- search space
- artificial neural networks
- selection algorithm
- preprocessing
- machine learning