Simple approximative algorithms for free-support Wasserstein barycenters
From MaRDI portal
Recommendations
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- On the computation of Wasserstein barycenters
- Discrete Wasserstein barycenters: optimal transport for discrete data
- Randomized Wasserstein barycenter computation: resampling with statistical guarantees
- Learning to generate Wasserstein barycenters
Cites work
- A column generation approach to the discrete barycenter problem
- A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters
- A fixed-point approach to barycenters in Wasserstein space
- A generative model for texture synthesis based on optimal transport between feature distributions
- A linear optimal transportation framework for quantifying and visualizing variations in sets of images
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- Barycenters in the Wasserstein space
- Breakdown points of affine equivariant estimators of multivariate location and covariance matrices
- Characterization of barycenters in the Wasserstein space by averaging optimal transport maps
- Computational optimal transport. With applications to data sciences
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Discrete Wasserstein barycenters: optimal transport for discrete data
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- Fréchet means and Procrustes analysis in Wasserstein space
- Fréchet means for distributions of persistence diagrams
- Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm
- Gradient flows in metric spaces and in the space of probability measures
- scientific article; zbMATH DE number 7370561 (Why is no real title available?)
- scientific article; zbMATH DE number 7370595 (Why is no real title available?)
- Iterative Bregman projections for regularized transportation problems
- Linear optimal transport embedding: provable Wasserstein classification for certain rigid transformations and perturbations
- Local Geometry of Deformable Templates
- Matching for teams
- Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem
- On the computation of Wasserstein barycenters
- Optimal maps for the multidimensional Monge-Kantorovich problem
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Randomized Wasserstein barycenter computation: resampling with statistical guarantees
- Scalable Bayes via barycenter in Wasserstein space
- The algebraic degree of geometric optimization problems
- The Linearized Hellinger--Kantorovich Distance
- Unbalanced multi-marginal optimal transport
- Wasserstein Barycenters Are NP-Hard to Compute
- Weiszfeld's method: old and new results
Cited in
(13)- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- On the computational complexity of finding a sparse Wasserstein barycenter
- On the computation of Wasserstein barycenters
- scientific article; zbMATH DE number 7370561 (Why is no real title available?)
- Wasserstein Barycenters Are NP-Hard to Compute
- Randomized Wasserstein barycenter computation: resampling with statistical guarantees
- Gradient projection methods for the $n$-coupling problem
- Learning to generate Wasserstein barycenters
- Simple Approximative Algorithms for Free-Support Wasserstein Barycenters
- Computing Wasserstein barycenters via operator splitting: the method of averaged marginals
- Sparse Wasserstein barycenters and application to reduced order modeling
- Tangential fixpoint iterations for Gromov-Wasserstein barycenters
- Closing the gap: efficient algorithms for discrete Wasserstein barycenters
This page was built for publication: Simple approximative algorithms for free-support Wasserstein barycenters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701424)
