mlsanityData to 14 Oct 2026

LDLE: Low Distortion Local Eigenmaps

arXiv 2101.11055 ↗First posted 26 Jan 2021math.SP cs.LG math.APcited by 11

Not on the map. Why?

Abstract (arXiv)

We present Low Distortion Local Eigenmaps (LDLE), a manifold learning technique which constructs a set of low distortion local views of a dataset in lower dimension and registers them to obtain a global embedding. The local views are constructed using the global eigenvectors of the graph Laplacian and are registered using Procrustes analysis. The choice of these eigenvectors may vary across the regions. In contrast to existing techniques, LDLE can embed closed and non-orientable manifolds into their intrinsic dimension by tearing them apart. It also provides gluing instruction on the boundary of the torn embedding to help identify the topology of the original manifold. Our experimental results will show that LDLE largely preserved distances up to a constant scale while other techniques produced higher distortion. We also demonstrate that LDLE produces high quality embeddings even when the data is noisy or sparse.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 14 of its 53 references that are in the map. First posted on arXiv 26 Jan 2021.

Builds on

14 of 53 references.

References · 14

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  2. 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
  3. 2021Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolationcited by 24
  4. 2015Diffusion Netscited by 19
  5. 2020LOCA: LOcal Conformal Autoencoder for standardized data coordinatescited by 19
  6. 2020Convergence of Graph Laplacian with kNN Self-tuned Kernelscited by 17
  7. 2020Product Manifold Learningcited by 16
  8. 2019Geodesic Distance Estimation with Sphereletscited by 9
  9. 2019Selecting the independent coordinates of manifolds with large aspect ratioscited by 8
  10. 2018Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplaciancited by 6
  11. 2016Non-Redundant Spectral Dimensionality Reductioncited by 2
  12. 2018How can we naturally order and organize graph Laplacian eigenvectors?cited by 2
2 more
  1. 2017The Geometry of Nodal Sets and Outlier Detectioncited by 1
  2. 2018On the Dual Geometry of Laplacian Eigenfunctionscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 3; 2025: 2; 2026: 1.

11 papers.