Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
DOI10.1007/s00245-022-09911-xzbMath1502.90023arXiv2112.03581OpenAlexW4309332481MaRDI QIDQ2096952
Marcel Klatt, Axel Munk, Florian Heinemann
Publication date: 11 November 2022
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.03581
barycenterunbalanced optimal transportultrametric treesmulti-marginal transportWassersteinKantorovich-Rubinstein
Trees (05C05) Optimality conditions and duality in mathematical programming (90C46) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The space of ultrametric phylogenetic trees
- Discrete Wasserstein barycenters: optimal transport for discrete data
- The optimal partial transport problem
- Free boundaries in optimal transport and Monge-Ampère obstacle problems
- Geometric algorithms and combinatorial optimization.
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- An interpolating distance between optimal transport and Fisher-Rao metrics
- Unbalanced optimal transport: dynamic and Kantorovich formulations
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Multivariate goodness-of-fit tests based on Wasserstein distance
- Unnormalized optimal transport
- Procrustes metrics on covariance operators and optimal transportation of Gaussian processes
- Sliced and Radon Wasserstein barycenters of measures
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Linear and nonlinear programming
- Existence and consistency of Wasserstein barycenters
- Generalized Wasserstein distance and its application to transport equations with source
- Convolutional wasserstein distances
- Barycenters in the Wasserstein Space
- Scaling algorithms for unbalanced optimal transport problems
- Barycenters for the Hellinger--Kantorovich Distance Over $\mathbb{R}^d$
- THE MULTI-MARGINAL OPTIMAL PARTIAL TRANSPORT PROBLEM
- Numerical methods for matching for teams and Wasserstein barycenters
- Kantorovich-Rubinstein Norm and Its Application in the Theory of Lipschitz Spaces
- Shape recognition via Wasserstein distance
- Inference for Empirical Wasserstein Distances on Finite Spaces
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- The Phylogenetic Kantorovich–Rubinstein Metric for Environmental Sequence Samples
- Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning
- A Framework for Wasserstein-1-Type Metrics
- Empirical Regularized Optimal Transport: Statistical Theory and Applications
- Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees
- Imaging with Kantorovich--Rubinstein Discrepancy
- A GEOMETRIC STUDY OF WASSERSTEIN SPACES: ULTRAMETRICS
- An Invitation to Statistics in Wasserstein Space
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Iterative Bregman Projections for Regularized Transportation Problems
- Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
- Optimal Transport
This page was built for publication: Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
