Variational Wasserstein Barycenters for Geometric Clustering
arXiv:2002.10543
Abstract
We propose to compute Wasserstein barycenters (WBs) by solving for Monge maps with variational principle. We discuss the metric properties of WBs and explore their connections, especially the connections of Monge WBs, to K-means clustering and co-clustering. We also discuss the feasibility of Monge WBs on unbalanced measures and spherical domains. We propose two new problems -- regularized K-means and Wasserstein barycenter compression. We demonstrate the use of VWBs in solving these clustering-related problems.
References in corpus (11)
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- Fast Computation of Wasserstein Barycenters
- A Sparse Multi-Scale Algorithm for Dense Optimal Transport
- Stochastic Wasserstein Barycenters
- Towards Optimal Transport with Global Invariances
- Multilevel Clustering via Wasserstein Means
- Variational Principles for Minkowski Type Problems, Discrete Optimal Transport, and Discrete Monge-Ampere Equations
- Hierarchical Optimal Transport for Multimodal Distribution Alignment
- Multiscale Strategies for Computing Optimal Transport
- Approximation of Wasserstein distance with Transshipment
- Regularized Wasserstein Means for Aligning Distributional Data