scientific article; zbMATH DE number 7370561

MaRDI QIDQ4998935zbMATH OpenFDO

Authors Enric Boix-Adserà, Jason M. Altschuler

Publication date 9 July 2021

Full work available at URL https://arxiv.org/abs/2006.08012, https://jmlr.csail.mit.edu/papers/v22/20-588.html

zbMATH Keywords

polynomial-time algorithmpower diagramsWasserstein barycentersfree supportexponentialsize linear program

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

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

Cites work

• A fixed-point approach to barycenters in Wasserstein space
• An optimal convex hull algorithm in any fixed dimension
• Barycenters in the Wasserstein space
• Computing medians and means in Hadamard spaces
• Concrete and abstract Voronoi diagrams
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
• Discrete Wasserstein barycenters: optimal transport for discrete data
• Iterative Bregman projections for regularized transportation problems
• Numerical methods for matching for teams and Wasserstein barycenters
• On the \(n\)-coupling problem
• On the computational complexity of finding a sparse Wasserstein barycenter
• Polynomial algorithms in linear programming
• Power Diagrams: Properties, Algorithms and Applications
• Scalable Bayes via barycenter in Wasserstein space
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(13)

• Polynomial-time algorithms for multimarginal optimal transport problems with structure
• 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
• Wasserstein barycenters can be computed in polynomial time in fixed dimension
• Hardness results for multimarginal optimal transport problems
• Hierarchical optimal transport for unsupervised domain adaptation
• Sparse Wasserstein barycenters and application to reduced order modeling
• Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
• Proxying credit curves via Wasserstein distances

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)