English

Estimation of Local Geometric Structure on Manifolds from Noisy Data

Statistics Theory 2025-03-11 v1 Statistics Theory

Abstract

A common observation in data-driven applications is that high-dimensional data have a low intrinsic dimension, at least locally. In this work, we consider the problem of point estimation for manifold-valued data. Namely, given a finite set of noisy samples of M\mathcal{M}, a dd dimensional submanifold of RD\mathbb{R}^D, and a point rr near the manifold we aim to project rr onto the manifold. Assuming that the data was sampled uniformly from a tubular neighborhood of a kk-times smooth boundaryless and compact manifold, we present an algorithm that takes rr from this neighborhood and outputs p^nRD\hat p_n\in \mathbb{R}^D, and Tp^nM^\widehat{T_{\hat p_n}\mathcal{M}} an element in the Grassmannian Gr(d,D)Gr(d, D). We prove that as the number of samples nn\to\infty, the point p^n\hat p_n converges to pM\mathbf{p}\in \mathcal{M}, the projection of rr onto M\mathcal{M}, and Tp^nM^\widehat{T_{\hat p_n}\mathcal{M}} converges to TpMT_{\mathbf{p}}\mathcal{M} (the tangent space at that point) with high probability. Furthermore, we show that p^n\hat p_n approaches the manifold with an asymptotic rate of nk2k+dn^{-\frac{k}{2k + d}}, and that p^n,Tp^nM^\hat p_n, \widehat{T_{\hat p_n}\mathcal{M}} approach p\mathbf{p} and TpMT_{\mathbf{p}}\mathcal{M} correspondingly with asymptotic rates of nk12k+dn^{-\frac{k-1}{2k + d}}.

Keywords

Cite

@article{arxiv.2503.07220,
  title  = {Estimation of Local Geometric Structure on Manifolds from Noisy Data},
  author = {Yariv Aizenbud and Barak Sober},
  journal= {arXiv preprint arXiv:2503.07220},
  year   = {2025}
}