Reconstruction of a Riemannian manifold from noisy intrinsic distances
Abstract
We consider reconstruction of a manifold, or, invariant manifold learning, where a smooth Riemannian manifold M is determined from intrinsic distances (that is, geodesic distances) of points in a discrete subset of M. In the studied problem the Riemannian manifold (M,g) is considered as an abstract metric space with intrinsic distances, not as an embedded submanifold of an ambient Euclidean space. Let \X1,X2,…,XN\ bea set of N sample points sampled randomly from an unknown Riemannian M manifold. We assume that we are given the numbers Djk=dM(Xj,Xk)+ηjk, where j,k∈ \1,2,…,N\. Here, dM(Xj,Xk) are geodesic distances, ηjk are independent, identically distributed random variables such that E e|ηjk| is finite. We show that when N is large enough, it is possible to construct an approximation of the Riemannian manifold (M,g) with a large probability. This problem is a generalization of the geometric Whitney problem with random measurement errors. We consider also the case when the information on noisy distance Djk of points Xj and Xk is missing with some probability. In particular, we consider the case when we have no information on points that are far away.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.