mlsanityData to 7 Oct 2026

Non-Parametric Manifold Learning

arXiv 2107.08089 ↗First posted 16 Jul 2021math.ST stat.ML stat.THcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce an estimator for distances in a compact Riemannian manifold based on graph Laplacian estimates of the Laplace-Beltrami operator. We upper bound the error in the estimate of manifold distances, or more precisely an estimate of a spectrally truncated variant of manifold distance of interest in non-commutative geometry (cf. [Connes and Suijelekom, 2020]), in terms of spectral errors in the graph Laplacian estimates and, implicitly, several geometric properties of the manifold. A consequence is a proof of consistency for (untruncated) manifold distances. The estimator resembles, and in fact its convergence properties are derived from, a special case of the Kontorovic dual reformulation of Wasserstein distance known as Connes' Distance Formula.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 45 references that are in the map. First posted on arXiv 16 Jul 2021.

Builds on

7 of 45 references.

References · 7

  1. 2014A survey of dimensionality reduction techniquescited by 50
  2. 2013Non-linear dimensionality reduction: Riemannian metric estimation and the problem of geometric discoverycited by 14
  3. 2020Ollivier-Ricci curvature convergence in random geometric graphscited by 11
  4. 2015Spectral Convergence Rate of Graph Laplaciancited by 6
  5. 2016Data driven estimation of Laplace-Beltrami operatorcited by 4
  6. 2017Unconstrained and Curvature-Constrained Shortest-Path Distances and their Approximationcited by 4
  7. 2020Minimax Estimation of Distances on a Surface and Minimax Manifold Learning in the Isometric-to-Convex Settingcited by 3

Built on by

Not cited yet.