Discrete Wasserstein barycenters: optimal transport for discrete data

DOI10.1007/s00186-016-0549-xzbMath1353.90074arXiv1507.07218OpenAlexW2298250094MaRDI QIDQ343818

Jacob Miller, Steffen Borgwardt, Ethan B. Anderes

Publication date: 29 November 2016

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

mathematical programmingbarycenteroptimal transportpolyhedral theorymultiple marginals

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Discrete location and assignment (90B80)

Related Items (22)

Geometric Averages of Partitioned Datasets ⋮ Wasserstein Barycenters Are NP-Hard to Compute ⋮ Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees ⋮ A GPM-based algorithm for solving regularized Wasserstein barycenter problems in some spaces of probability measures ⋮ Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Generalized Wasserstein barycenters between probability measures living on different subspaces ⋮ A column generation approach to the discrete barycenter problem ⋮ Simple approximative algorithms for free-support Wasserstein barycenters ⋮ Fréchet means and Procrustes analysis in Wasserstein space ⋮ Metrics and barycenters for point pattern data ⋮ Optimal transport and barycenters for dendritic measures ⋮ Unnamed Item ⋮ On the computational complexity of finding a sparse Wasserstein barycenter ⋮ Minimax estimation of smooth optimal transport maps ⋮ On the computation of Wasserstein barycenters ⋮ Good Clusterings Have Large Volume ⋮ Hardness results for multimarginal optimal transport problems ⋮ Robust clustering tools based on optimal transportation ⋮ Unnamed Item ⋮ Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms

Uses Software

• Julia

Cites Work

• Model-independent bounds for option prices -- a mass transport approach
• Multi-marginal optimal transport and multi-agent matching problems: uniqueness and structure of solutions
• On the local structure of optimal measures in the multi-marginal optimal transportation problem
• Fréchet means for distributions of persistence diagrams
• Matching for teams
• Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
• Deformable template models: a review.
• Optimal transportation with infinitely many marginals
• Probabilistic Fréchet means for time varying persistence diagrams
• Distribution's template estimate with Wasserstein metrics
• A stochastic control approach to no-arbitrage bounds given marginals, with an application to lookback options
• Julia: A Fresh Approach to Numerical Computing
• Probability measures on the space of persistence diagrams
• Uniqueness and Monge Solutions in the Multimarginal Optimal Transportation Problem
• Barycenters in the Wasserstein Space
• Duality theorems for marginal problems
• Numerical methods for matching for teams and Wasserstein barycenters
• Computing in Operations Research Using Julia
• The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications
• Optimal maps for the multidimensional Monge-Kantorovich problem
• Density Functional Theory and Optimal Transportation with Coulomb Cost
• Local Geometry of Deformable Templates
• Optimal Transport
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete Wasserstein barycenters: optimal transport for discrete data