JMLR

Estimation of Local Geometric Structure on Manifolds from Noisy Data

Authors
Yariv Aizenbud Barak Sober
Paper Information
  • Journal:
    Journal of Machine Learning Research
  • Added to Tracker:
    Jul 15, 2025
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 $\mathcal{M}$, a $d$ dimensional submanifold of $\mathbb{R}^D$, and a point $r$ near the manifold we aim to project $r$ onto the manifold. Assuming that the data was sampled uniformly from a tubular neighborhood of a $k$-times smooth boundaryless and compact manifold, we present an algorithm that takes $r$ from this neighborhood and outputs $\hat p_n\in \mathbb{R}^D$, and $\widehat{T_{\hat p_n}\mathcal{M}}$ an element in the Grassmannian $Gr(d, D)$. We prove that as the number of samples $n\to\infty$, the point $\hat p_n$ converges to $\mathbf{p}\in \mathcal{M}$, the projection of $r$ onto $\mathcal{M}$, and $\widehat{T_{\hat p_n}\mathcal{M}}$ converges to $T_{\mathbf{p}}\mathcal{M}$ (the tangent space at that point) with high probability. Furthermore, we show that $\hat p_n$ approaches the manifold with an asymptotic rate of $n^{-\frac{k}{2k + d}}$, and that $\hat p_n, \widehat{T_{\hat p_n}\mathcal{M}}$ approach $\mathbf{p}$ and $T_{\mathbf{p}}\mathcal{M}$ correspondingly with asymptotic rates of $n^{-\frac{k-1}{2k + d}}$. %While we These rates coincide with the optimal rates for the estimation of function derivatives.

Author Details
Yariv Aizenbud
Author
Barak Sober
Author
Citation Information
APA Format
Yariv Aizenbud & Barak Sober . Estimation of Local Geometric Structure on Manifolds from Noisy Data. Journal of Machine Learning Research .
BibTeX Format
@article{JMLR:v26:25-0183,
  author  = {Yariv Aizenbud and Barak Sober},
  title   = {Estimation of Local Geometric Structure on Manifolds from Noisy Data},
  journal = {Journal of Machine Learning Research},
  year    = {2025},
  volume  = {26},
  number  = {64},
  pages   = {1--89},
  url     = {http://jmlr.org/papers/v26/25-0183.html}
}
Related Papers