Accepted Paper

Inserted: 24 dec 2020
Last Updated: 3 dec 2023

Journal: ESAIM: COCV
Year: 2020

Abstract:

We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its ``sufficiently large'' subset. This is one of the classical manifold learning problems. It happens that the most popular methods to deal with such a problem, with long history in data science, namely, the classical Multidimensional scaling (MDS) and the Maximum variance unfolding (MVU) actually miss the point and may provide results very far from an isometry; moreover, they even may give no \textcolor{red}{bi-Lipshitz} embedding. We will provide an easy variational formulation of this problem which leads to an algorithm always providing an almost isometric embedding with the distortion of original distances as small as desired (the parameter regulating the upper bound for the desired distortion is an input parameter of this algorithm).

Keywords: manifold learning, multidimensional scaling, maximum variance unfolding, manifold embedding

Download:

• manifold-reconstruction20d.pdf