Selecting the independent coordinates of manifolds with large aspect ratios
arXiv:1907.01651
Abstract
Many manifold embedding algorithms fail apparently when the data manifold has a large aspect ratio (such as a long, thin strip). Here, we formulate success and failure in terms of finding a smooth embedding, showing also that the problem is pervasive and more complex than previously recognized. Mathematically, success is possible under very broad conditions, provided that embedding is done by carefully selected eigenfunctions of the Laplace-Beltrami operator . Hence, we propose a bicriterial Independent Eigencoordinate Selection (IES) algorithm that selects smooth embeddings with few eigenvectors. The algorithm is grounded in theory, has low computational overhead, and is successful on synthetic and large real data.
References in corpus (7)
- UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
- The Seventh Data Release of the Sloan Digital Sky Survey
- Machine Learning of Accurate Energy-Conserving Molecular Force Fields
- Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck operators
- Manifold Learning: The Price of Normalization
- Randomized partition trees for exact nearest neighbor search
- Non-linear dimensionality reduction: Riemannian metric estimation and the problem of geometric discovery