Estimation of Local Geometric Structure on Manifolds from Noisy Data

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, a d dimensional submanifold of RD, 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 pn∈ RD, and T pnM an element in the Grassmannian Gr(d, D). We prove that as the number of samples n∞, the point pn converges to p∈ M, the projection of r onto M, and T pnM converges to TpM (the tangent space at that point) with high probability. Furthermore, we show that pn approaches the manifold with an asymptotic rate of n-k2k + d, and that pn, T pnM approach p and TpM correspondingly with asymptotic rates of n-k-12k + d.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…