Manifold learning in Wasserstein space

Abstract

This paper aims at building the theoretical foundations for manifold learning algorithms in the space of absolutely continuous probability measures Pa.c.() with a compact and convex subset of Rd, metrized with the Wasserstein-2 distance W. We begin by introducing a construction of submanifolds in Pa.c.() equipped with metric W, the geodesic restriction of W to . 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 Rd. We then show how the latent manifold structure of (,W) can be learned from samples \λi\i=1N of and pairwise extrinsic Wasserstein distances W on Pa.c.() only. In particular, we show that the metric space (,W) can be asymptotically recovered in the sense of Gromov--Wasserstein from a graph with nodes \λi\i=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 \λi\i=1N. The paper closes with some explicit constructions of submanifolds and numerical examples on the recovery of tangent spaces through spectral analysis.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…