Laplace Learning in Wasserstein Space
Not on the map. Why?
Abstract (arXiv)
The manifold hypothesis posits that high-dimensional data typically resides on low-dimensional sub spaces. In this paper, we assume manifold hypothesis to investigate graph-based semi-supervised learning methods. In particular, we examine Laplace Learning in the Wasserstein space, extending the classical notion of graph-based semi-supervised learning algorithms from finite-dimensional Euclidean spaces to an infinite-dimensional setting. To achieve this, we prove variational convergence of a discrete graph p- Dirichlet energy to its continuum counterpart. In addition, we characterize the Laplace-Beltrami operator on asubmanifold of the Wasserstein space. Finally, we validate the proposed theoretical framework through numerical experiments conducted on benchmark datasets, demonstrating the consistency of our classification performance in high-dimensional settings.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 19 of its 69 references that are in the map. First posted on arXiv 17 Nov 2025.
Builds on
19 of 69 references.
References · 19
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
- 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
- 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
- 2020The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxationcited by 55
- 2017Analysis of p-Laplacian Regularization in Semi-Supervised Learningcited by 39
- 2020Lipschitz regularity of graph Laplacians on random data cloudscited by 26
- 2014Continuum limit of total variation on point cloudscited by 24
- 2017The game theoretic p-Laplacian and semi-supervised learning with few labelscited by 22
- 2022Sliced Optimal Partial Transportcited by 19
- 2015Algorithms for Lipschitz Learning on Graphscited by 16
- 2022Wassmap: Wasserstein Isometric Mapping for Image Manifold Learningcited by 15
7 more
- 2019Analysis and algorithms for ℓp-based semi-supervised learning on graphscited by 14
- 2021The Linearized Hellinger--Kantorovich Distancecited by 11
- 2023Manifold learning in Wasserstein spacecited by 6
- 2017On the Consistency of Graph-based Bayesian Learning and the Scalability of Sampling Algorithmscited by 5
- 2023Approximation Theory, Computing, and Deep Learning on the Wasserstein Spacecited by 3
- 2023PTLp: Partial Transport Lp Distancescited by 2
- 2022Gamma-Convergence of an Ambrosio-Tortorelli approximation scheme for image segmentationcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.