A kernel-based analysis of Laplacian Eigenmaps
Statistics Theory
2024-02-27 v1 Probability
Spectral Theory
Machine Learning
Statistics Theory
Abstract
Given i.i.d. observations uniformly distributed on a closed manifold , we study the spectral properties of the associated empirical graph Laplacian based on a Gaussian kernel. Our main results are non-asymptotic error bounds, showing that the eigenvalues and eigenspaces of the empirical graph Laplacian are close to the eigenvalues and eigenspaces of the Laplace-Beltrami operator of . In our analysis, we connect the empirical graph Laplacian to kernel principal component analysis, and consider the heat kernel of as reproducing kernel feature map. This leads to novel points of view and allows to leverage results for empirical covariance operators in infinite dimensions.
Cite
@article{arxiv.2402.16481,
title = {A kernel-based analysis of Laplacian Eigenmaps},
author = {Martin Wahl},
journal= {arXiv preprint arXiv:2402.16481},
year = {2024}
}
Comments
43 pages