Statistical learning in Wasserstein space
Not on the map. Why?
Abstract (arXiv)
We seek a generalization of regression and principle component analysis (PCA) in a metric space where data points are distributions metrized by the Wasserstein metric. We recast these analyses as multimarginal optimal transport problems. The particular formulation allows efficient computation, ensures existence of optimal solutions, and admits a probabilistic interpretation over the space of paths (line segments). Application of the theory to the interpolation of empirical distributions, images, power spectra, as well as assessing uncertainty in experimental designs, is envisioned.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.
- 2021On the complexity of the optimal transport problem with graph-structured costcited by 14
- 2023Bures-Wasserstein Means of Graphscited by 6
- 2023Bures-Wasserstein Means of Graphs31 May 2023
- 2021On the complexity of the optimal transport problem with graph-structured cost1 Oct 2021