scientific article; zbMATH DE number 7370561

MaRDI QIDQ4998935

Enric Boix-Adserà, Jason M. Altschuler

Publication date: 9 July 2021

Full work available at URL: https://arxiv.org/abs/2006.08012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial-time algorithmpower diagramsWasserstein barycentersfree supportexponentialsize linear program

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

Wasserstein Barycenters Are NP-Hard to Compute ⋮ Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ Hierarchical optimal transport for unsupervised domain adaptation ⋮ Quantitative stability of barycenters in the Wasserstein space ⋮ Simple approximative algorithms for free-support Wasserstein barycenters ⋮ Hardness results for multimarginal optimal transport problems ⋮ Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms

Cites Work

• Unnamed Item
• A fixed-point approach to barycenters in Wasserstein space
• Discrete Wasserstein barycenters: optimal transport for discrete data
• On the \(n\)-coupling problem
• The ellipsoid method and its consequences in combinatorial optimization
• Concrete and abstract Voronoi diagrams
• An optimal convex hull algorithm in any fixed dimension
• On the computational complexity of finding a sparse Wasserstein barycenter
• Convolutional wasserstein distances
• Computing Medians and Means in Hadamard Spaces
• Barycenters in the Wasserstein Space
• Numerical methods for matching for teams and Wasserstein barycenters
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Polynomial algorithms in linear programming
• Power Diagrams: Properties, Algorithms and Applications
• Iterative Bregman Projections for Regularized Transportation Problems

This page was built for publication: