mlsanityData to 7 Oct 2026

Manifold learning in Wasserstein space

arXiv 2311.08549 ↗First posted 14 Nov 2023stat.ML cs.LG math.DGcited by 6

Not on the map. Why?

Abstract (arXiv)

This paper aims at building the theoretical foundations for manifold learning algorithms in the space of absolutely continuous probability measures Pa.c.(Omega) with Omega a compact and convex subset of ℝd, metrized with the Wasserstein-2 distance mathbbW. We begin by introducing a construction of submanifolds Lambda in Pa.c.(Omega) equipped with metric mathbbW_Lambda, the geodesic restriction of mathbbW to Lambda. In contrast to other constructions, these submanifolds are not necessarily flat, but still allow for local linearizations in a similar fashion to Riemannian submanifolds of ℝd. We then show how the latent manifold structure of (Lambda,mathbbWLambda) can be learned from samples λii=1N of Lambda and pairwise extrinsic Wasserstein distances mathbbW on Pa.c.(Omega) only. In particular, we show that the metric space (Lambda,mathbbWLambda) can be asymptotically recovered in the sense of Gromov--Wasserstein from a graph with nodes λii=1N and edge weights W(λi,λj). In addition, we demonstrate how the tangent space at a sample λ can be asymptotically recovered via spectral analysis of a suitable ``covariance operator'' using optimal transport maps from λ to sufficiently close and diverse samples λii=1N. The paper closes with some explicit constructions of submanifolds Lambda and numerical examples on the recovery of tangent spaces through spectral analysis.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 17 of its 73 references that are in the map. First posted on arXiv 14 Nov 2023.

Builds on

17 of 73 references.

References · 17

  1. 2018Computational Optimal Transportcited by 765
  2. 2021Entropic estimation of optimal transport mapscited by 87
  3. 2016Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problemscited by 69
  4. 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 52
  5. 2020Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbationscited by 37
  6. 2022Wassmap: Wasserstein Isometric Mapping for Image Manifold Learningcited by 15
  7. 2022Supervised learning of sheared distributions using linearized optimal transportcited by 14
  8. 2023Linearized Wasserstein dimensionality reduction with approximation guaranteescited by 12
  9. 2021The Linearized Hellinger--Kantorovich Distancecited by 11
  10. 2023Neural Wasserstein Gradient Flows for Maximum Mean Discrepancies with Riesz Kernelscited by 9
  11. 2016Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Datacited by 8
  12. 2023Linear Optimal Partial Transport Embeddingcited by 8
5 more
  1. 2019Mumford-Shah functionals on graphs and their asymptoticscited by 6
  2. 2023Linearized optimal transport on manifoldscited by 6
  3. 2023Applications of No-Collision Transportation Maps in Manifold Learningcited by 6
  4. 2023Approximation Theory, Computing, and Deep Learning on the Wasserstein Spacecited by 3
  5. 2020A Linear Transportation Lp Distance for Pattern Recognitioncited by 2

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 4.

6 papers.