vix.ing · top · new · best · stats

Non-linear dimensionality reduction: Riemannian metric estimation and the problem of geometric discovery

2013/05/30 by Dominique Perraul-Joncas, Marina Meilă, Perraul-Joncas, Dominique +2 · 6 citations
Computer Science · Mathematics · #FOS: Computer and information sciences #Human Pose and Action Recognition #Machine Learning (stat.ML) #Morphological variations and asymmetry #Topological and Geometric Data Analysis #stat.ML

paper · pdf · doi:10.48550/arxiv.1305.7255

32 pages

arxiv created 2013/05/30 · openalex publication_date 2013/05/30 · arxiv updated 2013/06/03 · openalex created_date 2022/09/03 · openalex updated_date 2026/07/28

Abstract

In recent years, manifold learning has become increasingly popular as a tool for performing non-linear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity that aim to recover man ifold geometry using either local or global features of the data. Building on the Laplacian Eigenmap and Diffusionmaps framework, we propose a new paradigm that offers a guarantee, under reasonable assumptions, that any manifo ld learning algorithm will preserve the geometry of a data set. Our approach is based on augmenting the output of embedding algorithms with geometric informatio n embodied in the Riemannian metric of the manifold. We provide an algorithm for estimating the Riemannian metric from data and demonstrate possible application s of our approach in a variety of examples.

Citations

Cited by

Related