Non-Parametric Estimation of Manifolds from Noisy Data
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
- 2016Manifold Approximation by Moving Least-Squares Projection (MMLS)cited by 12
- 2017Manifold Learning Using Kernel Density Estimation and Local Principal Components Analysiscited by 7
- 2017Approximation of Functions over Manifolds: A Moving Least-Squares Approachcited by 5
- 2015PCA-Based Out-of-Sample Extension for Dimensionality Reductioncited by 3
- 2020Approximating the Riemannian Metric from Point Clouds via Manifold Moving Least Squarescited by 3
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 2; 2025: 3; 2026: 1.
12 papers.
- 2021Tangent Space and Dimension Estimation with the Wasserstein Distancecited by 10
- 2022Semi-Supervised Manifold Learning with Complexity Decoupled Chart Autoencoderscited by 8
- 2021Probabilistic Robust Autoencoders for Outlier Detectioncited by 7
- 2023Quadratic Matrix Factorization with Applications to Manifold Learningcited by 5
- 2022Manifold Free Riemannian Optimizationcited by 4
- 2023CA-PCA: Manifold Dimension Estimation, Adapted for Curvaturecited by 4
- 2024Design a Metric Robust to Complicated High Dimensional Noise for Efficient Manifold Denoisingcited by 1
- 2024Subspace-Constrained Quadratic Matrix Factorization: Algorithm and Applicationscited by 1
- 2026A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learningcited by 1
- 2025High-Dimensional Statistical Process Control via Manifold Fitting and Learningcited by 0
- 2025Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalizationcited by 0
- 2025Manifold Dimension Estimation via Local Graph Structurecited by 0
- 2026A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning5 May 2026
- 2025Manifold Dimension Estimation via Local Graph Structure16 Oct 2025
- 2025Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization2 Oct 2025
- 2025High-Dimensional Statistical Process Control via Manifold Fitting and Learning24 Sep 2025
- 2024Subspace-Constrained Quadratic Matrix Factorization: Algorithm and Applications7 Nov 2024
- 2024Design a Metric Robust to Complicated High Dimensional Noise for Efficient Manifold Denoising8 Jan 2024
- 2023CA-PCA: Manifold Dimension Estimation, Adapted for Curvature23 Sep 2023
- 2023Quadratic Matrix Factorization with Applications to Manifold Learning30 Jan 2023
- 2022Manifold Free Riemannian Optimization7 Sep 2022
- 2022Semi-Supervised Manifold Learning with Complexity Decoupled Chart Autoencoders22 Aug 2022
- 2021Tangent Space and Dimension Estimation with the Wasserstein Distance12 Oct 2021
- 2021Probabilistic Robust Autoencoders for Outlier Detection1 Oct 2021