The minimax rate for estimating eigenpairs of weighted Laplace-Beltrami operators from n samples on a d-dimensional manifold is n^{-2/(d+4)}, and graph Laplacians achieve this rate up to logarithmic factors.
Spectral Convergence of Symmetrized Graph Laplacian on manifolds with boundary
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study the spectral convergence of a symmetrized Graph Laplacian matrix induced by a Gaussian kernel evaluated on pairs of embedded data, sampled from a manifold with boundary, a sub-manifold of $\mathbb{R}^m$. Specifically, we deduce the convergence rates for eigenpairs of the discrete Graph-Laplacian matrix to the eigensolutions of the Laplace-Beltrami operator that are well-defined on manifolds with boundary, including the homogeneous Neumann and Dirichlet boundary conditions. For the Dirichlet problem, we deduce the convergence of the \emph{truncated Graph Laplacian}, which is recently numerically observed in applications, and provide a detailed numerical investigation on simple manifolds. Our method of proof relies on the min-max argument over a compact and symmetric integral operator, leveraging the RKHS theory for spectral convergence of integral operator and a recent pointwise asymptotic result of a Gaussian kernel integral operator on manifolds with boundary.
citation-role summary
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Minimax Rates for the Estimation of Eigenpairs of Weighted Laplace-Beltrami Operators on Manifolds
The minimax rate for estimating eigenpairs of weighted Laplace-Beltrami operators from n samples on a d-dimensional manifold is n^{-2/(d+4)}, and graph Laplacians achieve this rate up to logarithmic factors.