On the computation of Wasserstein barycenters
From MaRDI portal
Publication:2293547
DOI10.1016/j.jmva.2019.104581zbMath1490.62022OpenAlexW2910908131MaRDI QIDQ2293547
Giovanni Puccetti, Steven Vanduffel, Ludger Rüschendorf
Publication date: 5 February 2020
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2019.104581
image processingoptimal transportation\(k\)-means clusteringWasserstein barycenterswapping algorithm
Computational methods for problems pertaining to statistics (62-08) Computing methodologies for image processing (68U10) Approximation algorithms (68W25)
Related Items
Geometric Averages of Partitioned Datasets ⋮ On the use of Wasserstein distance in the distributional analysis of human decision making under uncertainty ⋮ \(L_p\)-norm spherical copulas ⋮ Simple approximative algorithms for free-support Wasserstein barycenters ⋮ On clustering uncertain and structured data with Wasserstein barycenters and a geodesic criterion for the number of clusters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm to approximate the optimal expected inner product of two vectors with given marginals
- A fixed-point approach to barycenters in Wasserstein space
- Discrete Wasserstein barycenters: optimal transport for discrete data
- On the \(n\)-coupling problem
- The Frechet distance between multivariate normal distributions
- A characterization of random variables with minimum \(L^ 2\)-distance
- On a generalization of cyclic monotonicity and distances among random vectors
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Sliced and Radon Wasserstein barycenters of measures
- Existence and consistency of Wasserstein barycenters
- Convolutional wasserstein distances
- Barycenters in the Wasserstein Space
- Numerical methods for matching for teams and Wasserstein barycenters
- Assignment Problems
- Polar factorization and monotone rearrangement of vector‐valued functions
- Optimal maps for the multidimensional Monge-Kantorovich problem
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Iterative Bregman Projections for Regularized Transportation Problems
- A General Condition for Monge Solutions in the Multi-Marginal Optimal Transport Problem
