Simple approximative algorithms for free-support Wasserstein barycenters

DOI10.1007/s10589-023-00458-3OpenAlexW4322738044MaRDI QIDQ2701424

Johannes von Lindheim

Publication date: 28 April 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

error analysisapproximative algorithmsparsityoptimal transportdiscrete Wasserstein barycenter

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80) Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• A fixed-point approach to barycenters in Wasserstein space
• Discrete Wasserstein barycenters: optimal transport for discrete data
• Fréchet means for distributions of persistence diagrams
• Breakdown points of affine equivariant estimators of multivariate location and covariance matrices
• Matching for teams
• The algebraic degree of geometric optimization problems
• Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm
• Fréchet means and Procrustes analysis in Wasserstein space
• 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
• Weiszfeld's method: old and new results
• On the computation of Wasserstein barycenters
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• A column generation approach to the discrete barycenter problem
• Convolutional wasserstein distances
• Barycenters in the Wasserstein Space
• Optimal maps for the multidimensional Monge-Kantorovich problem
• Characterization of barycenters in the Wasserstein space by averaging optimal transport maps
• Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
• Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem
• The Linearized Hellinger--Kantorovich Distance
• Wasserstein Barycenters Are NP-Hard to Compute
• Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees
• Iterative Bregman Projections for Regularized Transportation Problems
• Local Geometry of Deformable Templates
• Linear optimal transport embedding: provable Wasserstein classification for certain rigid transformations and perturbations
• A generative model for texture synthesis based on optimal transport between feature distributions
• Unbalanced multi-marginal optimal transport

This page was built for publication: Simple approximative algorithms for free-support Wasserstein barycenters