Spectral Convergence of the connection Laplacian from random samples

06/07/2013
by   Amit Singer, et al.
0

Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as Diffusion Maps and Laplacian Eigenmaps are often used for manifold learning and non-linear dimensionality reduction. It was previously shown by Belkin and Niyogi belkin_niyogi:2007 that the eigenvectors and eigenvalues of the graph Laplacian converge to the eigenfunctions and eigenvalues of the Laplace-Beltrami operator of the manifold in the limit of infinitely many data points sampled independently from the uniform distribution over the manifold. Recently, we introduced Vector Diffusion Maps and showed that the connection Laplacian of the tangent bundle of the manifold can be approximated from random samples. In this paper, we present a unified framework for approximating other connection Laplacians over the manifold by considering its principle bundle structure. We prove that the eigenvectors and eigenvalues of these Laplacians converge in the limit of infinitely many independent random samples. We generalize the spectral convergence results to the case where the data points are sampled from a non-uniform distribution, and for manifolds with and without boundary.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2023

Diffusion Maps for Group-Invariant Manifolds

In this article, we consider the manifold learning problem when the data...
research
06/03/2020

Spectral convergence of diffusion maps: improved error bounds and an alternative normalisation

Diffusion maps is a manifold learning algorithm widely used for dimensio...
research
06/10/2019

A Unified Definition and Computation of Laplacian Spectral Distances

Laplacian spectral kernels and distances (e.g., biharmonic, heat diffusi...
research
10/19/2020

Product Manifold Learning

We consider problems of dimensionality reduction and learning data repre...
research
06/16/2008

Manifold Learning: The Price of Normalization

We analyze the performance of a class of manifold-learning algorithms th...
research
06/12/2023

G-invariant diffusion maps

The diffusion maps embedding of data lying on a manifold have shown succ...
research
01/29/2019

A maximum principle argument for the uniform convergence of graph Laplacian regressors

We study asymptotic consistency guarantees for a non-parametric regressi...

Please sign up or login with your details

Forgot password? Click here to reset