scientific article; zbMATH DE number 7370561
From MaRDI portal
Publication:4998935
Authors: Enric Boix-Adserà, Jason M. Altschuler 
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/2006.08012
Title of this publication is not available (Why is that?)
Recommendations
- Wasserstein Barycenters Are NP-Hard to Compute
- On the computation of Wasserstein barycenters
- Computing Wasserstein barycenters via linear programming
- A fixed-point approach to barycenters in Wasserstein space
- On the computational complexity of finding a sparse Wasserstein barycenter
- A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters
- Barycenters in the Wasserstein space
- Barycenter in Wasserstein spaces: existence and consistency
- Simple approximative algorithms for free-support Wasserstein barycenters
- A canonical barycenter via Wasserstein regularization
polynomial-time algorithmpower diagramsWasserstein barycentersfree supportexponentialsize linear program
Cites Work
- Barycenters in the Wasserstein space
- Discrete Wasserstein barycenters: optimal transport for discrete data
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- The ellipsoid method and its consequences in combinatorial optimization
- Concrete and abstract Voronoi diagrams
- An optimal convex hull algorithm in any fixed dimension
- Polynomial algorithms in linear programming
- A fixed-point approach to barycenters in Wasserstein space
- Numerical methods for matching for teams and Wasserstein barycenters
- Power Diagrams: Properties, Algorithms and Applications
- Iterative Bregman projections for regularized transportation problems
- On the \(n\)-coupling problem
- Computing medians and means in Hadamard spaces
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Scalable Bayes via barycenter in Wasserstein space
- On the computational complexity of finding a sparse Wasserstein barycenter
Cited In (13)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Wasserstein barycenters can be computed in polynomial time in fixed dimension
- Simple approximative algorithms for free-support Wasserstein barycenters
- Wasserstein Barycenters Are NP-Hard to Compute
- Quantitative stability of barycenters in the Wasserstein space
- Computing Wasserstein barycenters via operator splitting: the method of averaged marginals
- The Wasserstein mean of unipotent matrices
- Dynamic programming in probability spaces via optimal transport
- Hardness results for multimarginal optimal transport problems
- Hierarchical optimal transport for unsupervised domain adaptation
- Sparse Wasserstein barycenters and application to reduced order modeling
- Proxying credit curves via Wasserstein distances
- Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998935)
