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.
How well behaved is finite dimensional Diffusion Maps?
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Under a set of assumptions on a family of submanifolds $\subset {\mathbb R}^D$, we derive a series of geometric properties that remain valid after finite-dimensional and almost isometric Diffusion Maps (DM), including almost uniform density, finite polynomial approximation and reach. Leveraging these properties, we establish rigorous bounds on the embedding errors introduced by the DM algorithm is $O\left((\frac{\log n}{n})^{\frac{1}{8d+16}}\right)$. Furthermore, we quantify the error between the estimated tangent spaces and the true tangent spaces over the submanifolds after the DM embedding, $\sup_{P\in \mathcal{P}}\mathbb{E}_{P^{\otimes \tilde{n}}} \max_{1\leq j \angle (T_{Y_{\varphi(M),j}}\varphi(M),\hat{T}_j)\leq \tilde{n}} \leq C \left(\frac{\log n }{n}\right)^\frac{k-1}{(8d+16)k}$, which providing a precise characterization of the geometric accuracy of the embeddings. These results offer a solid theoretical foundation for understanding the performance and reliability of DM in practical applications.
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.