On the computation of Wasserstein barycenters
DOI10.1016/J.JMVA.2019.104581zbMATH Open1490.62022OpenAlexW2910908131MaRDI QIDQ2293547FDOQ2293547
Authors: 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
Recommendations
\(k\)-means clusteringswapping algorithmimage processingoptimal transportationWasserstein barycenter
Computational methods for problems pertaining to statistics (62-08) Computing methodologies for image processing (68U10) Approximation algorithms (68W25)
Cites Work
- A characterization of random variables with minimum \(L^ 2\)-distance
- Barycenters in the Wasserstein space
- Discrete Wasserstein barycenters: optimal transport for discrete data
- Polar factorization and monotone rearrangement of vector‐valued functions
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Assignment Problems
- An algorithm to approximate the optimal expected inner product of two vectors with given marginals
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Title not available (Why is that?)
- Optimal maps for the multidimensional Monge-Kantorovich problem
- A general condition for Monge solutions in the multi-marginal optimal transport problem
- The Frechet distance between multivariate normal distributions
- On a generalization of cyclic monotonicity and distances among random vectors
- Existence and consistency of Wasserstein barycenters
- A fixed-point approach to barycenters in Wasserstein space
- Numerical methods for matching for teams and Wasserstein barycenters
- Iterative Bregman projections for regularized transportation problems
- On the \(n\)-coupling problem
- Sliced and Radon Wasserstein barycenters of measures
- Title not available (Why is that?)
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Title not available (Why is that?)
Cited In (24)
- Randomized Wasserstein barycenter computation: resampling with statistical guarantees
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- On the computational complexity of finding a sparse Wasserstein barycenter
- A fixed-point approach to barycenters in Wasserstein space
- Gradient projection methods for the $n$-coupling problem
- Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters
- Simple approximative algorithms for free-support Wasserstein barycenters
- Learning to generate Wasserstein barycenters
- Title not available (Why is that?)
- Multisource Single-Cell Data Integration by MAW Barycenter for Gaussian Mixture Models
- Geometric Averages of Partitioned Datasets
- Stochastic saddle-point optimization for the Wasserstein barycenter problem
- Clustering, factor discovery and optimal transport
- Computing Wasserstein barycenters via operator splitting: the method of averaged marginals
- Existence and consistency of Wasserstein barycenters
- \(L_p\)-norm spherical copulas
- Sliced and Radon Wasserstein barycenters of measures
- Discrete Wasserstein barycenters: optimal transport for discrete data
- On clustering uncertain and structured data with Wasserstein barycenters and a geodesic criterion for the number of clusters
- Numerical methods for matching for teams and Wasserstein barycenters
- Sparse Wasserstein barycenters and application to reduced order modeling
- An algorithm to approximate the optimal expected inner product of two vectors with given marginals
- On the use of Wasserstein distance in the distributional analysis of human decision making under uncertainty
- Sample-based optimal transport and barycenter problems
This page was built for publication: On the computation of Wasserstein barycenters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293547)
