mlsanityData to 7 Oct 2026

Non-Parametric Estimation of Manifolds from Noisy Data

arXiv 2105.04754 ↗First posted 11 May 2021math.ST cs.LG stat.THcited by 12

Not on the map. Why?

Abstract (arXiv)

A common observation in data-driven applications is that high dimensional data has a low intrinsic dimension, at least locally. In this work, we consider the problem of estimating a d dimensional sub-manifold of ℝD from a finite set of noisy samples. Assuming that the data was sampled uniformly from a tubular neighborhood of M∈ Ck, a compact manifold without boundary, we present an algorithm that takes a point r from the tubular neighborhood and outputs hat pn∈ ℝD, and widehatThat pnM an element in the Grassmanian Gr(d, D). We prove that as the number of samples n→∞ the point hat pn converges to p∈ M and widehatThat pnM converges to TpM (the tangent space at that point) with high probability. Furthermore, we show that the estimation yields asymptotic rates of convergence of n^-frack2k + d for the point estimation and n^-frack-12k + d for the estimation of the tangent space. These rates are known to be optimal for the case of function estimation.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 5 of its 49 references that are in the map. First posted on arXiv 11 May 2021.

Builds on

5 of 49 references.

References · 5

  1. 2016Manifold Approximation by Moving Least-Squares Projection (MMLS)cited by 12
  2. 2017Manifold Learning Using Kernel Density Estimation and Local Principal Components Analysiscited by 7
  3. 2017Approximation of Functions over Manifolds: A Moving Least-Squares Approachcited by 5
  4. 2015PCA-Based Out-of-Sample Extension for Dimensionality Reductioncited by 3
  5. 2020Approximating the Riemannian Metric from Point Clouds via Manifold Moving Least Squarescited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 2; 2025: 3; 2026: 1.

12 papers.