Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.


Low dimensional embeddings of manifold data have gained popularity in the last decade. However, a systematic finite sample analysis of manifold embedding algorithms largely eludes researchers. Here we present two algorithms that, given access to just the samples, embed the underlying n- dimensional manifold into Rd (where d only depends on some key manifold properties such as its intrinsic dimension, volume and curvature) and guarantee to approximately preserve all interpoint geodesic distances.

Questions and Answers

You need to be logged in to be able to post here.