Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm.
Tianyi LinNhat HoXi ChenMarco CuturiMichael I. JordanPublished in: NeurIPS (2020)
Keyphrases
- computational complexity
- experimental evaluation
- np hard
- cost function
- learning algorithm
- estimation algorithm
- detection algorithm
- worst case
- preprocessing
- improved algorithm
- times faster
- optimization algorithm
- theoretical analysis
- fixed size
- genetic algorithm
- combinatorial optimization
- objective function
- computationally efficient
- particle swarm optimization
- high accuracy
- optimal solution
- computational cost
- dynamic programming
- search space
- k means
- segmentation algorithm
- mobile robot
- memory requirements
- pointwise
- significant improvement