The GenCol algorithm for high-dimensional optimal transport: general formulation and application to barycenters and Wasserstein splines
Not on the map. Why?
Abstract (arXiv)
We extend the recently introduced genetic column generation algorithm for high-dimensional multi-marginal optimal transport from symmetric to general problems. We use the algorithm to calculate accurate mesh-free Wasserstein barycenters and cubic Wasserstein splines.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 25 references that are in the map. First posted on arXiv 19 Sep 2022.
Builds on
12 of 25 references.
References · 12
- 2018Computational Optimal Transportcited by 765
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2016Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problemscited by 69
- 2014Multi-marginal optimal transport: theory and applicationscited by 41
- 2015A Smoothed Dual Approach for Variational Wasserstein Problemscited by 29
- 2018Second order models for optimal transport and cubic splines on the Wasserstein spacecited by 19
- 2018Measure-valued spline curves: an optimal transport viewpointcited by 17
- 2018A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenterscited by 8
- 2020Randomised Wasserstein Barycenter Computation: Resampling with Statistical Guaranteescited by 8
- 2021Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problemscited by 3
- 2018A simple counterexample to the Monge ansatz in multi-marginal optimal transport, convex geometry of the set of Kantorovich plans, and the Frenkel-Kontorova modelcited by 2
- 2018Non-existence of optimal transport maps for the multi-marginal repulsive harmonic costcited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.