Aug 2026· 2 citations· ⚡ 1 influential· 24 references
MathematicsComputer Science
TL;DR
It is proved that the appropriately scaled DM kernel converges uniformly to the heat kernel on the manifold for sufficiently large times as the dataset size increases and the kernel bandwidth is scaled appropriately.
Abstract
In this paper, we study kernel ridge regression using the data-driven diffusion maps (DM) kernel, which is constructed through algebraic manipulations of the diffusion maps algorithm. Under the assumptions that the data lie on a manifold and are sampled uniformly, we prove that the appropriately scaled DM kernel converges uniformly to the heat kernel on the manifold for sufficiently large times as the dataset size increases and the kernel bandwidth is scaled appropriately. Consequently, the limiting Reproducing Kernel Hilbert Space (RKHS) induced by the DM kernel coincides with the RKHS associated with the heat kernel on the manifold. We further show that the RKHS induced by the DM kernel is isometrically isomorphic to the RKHS of the Gaussian kernel, which is continuously embedded in the RKHS of a Mat\'ern kernel whose norm is equivalent to an appropriate Sobolev norm. This result implies that standard risk bounds for kernel ridge regression applicable to Mat\'ern kernels also apply to the DM kernel. Finally, we provide numerical results that (1) validate the convergence of the heat kernel approximation, (2) demonstrate the greater expressiveness of the DM kernel compared to the Gaussian kernel for supervised learning over a larger class of functions on manifolds with boundary, and (3) demonstrate the advantage of the DM kernel over the Gaussian kernel in learning functions with varying frequencies and co-dimensions.
Kernel spectral algorithms are often summarized by convergence rates, which hide how their risk depends jointly on regularization, noise, the population spectrum, target coefficients, and the chosen filter. Gaussian sequence models arise as a simplified but characteristic setting for studying the interplay of these fac...
Yicheng Li, Yu-Qiang Cheng, Zhuo Chen et al.· 0 citations
Inverse inequalities are an important tool in the stability and convergence analysis of kernel approximation methods. In a multiscale setting, however, the trial space changes with the kernel scale $\delta$, and inverse estimates for a fixed kernel are not sufficient. The constants must remain controlled as $\delta\to0...
It is demonstrated that the eigenvalues of the kernel obtained by discretizing the integral using suitable quadrature formulas instead are approximated much better by the eigenvalues of the kernel obtained by discretizing the integral using suitable quadrature formulas instead.
A. Cloninger, Q. L. Le Gia, H. Mhaskar· 0 citations
The signed random Fourier features (SRFF) technique is introduced, a generalization of RFF compatible with indefinite kernels whose inverse Fourier transform is absolutely integrable and speed up KDE in the case of multivariate compact kernels, which are generally not positive definite.
The bound depends only logarithmically on the ambient dimension and on manifold parameters such as volume and reach, while retaining the $1/\varepsilon^2$ Euclidean rate.
A pointwise deterministic bound is derived on the discrepancy between the kernel ridge regression estimator and the ground truth in the corresponding Hilbert space norm for a vector-valued operator under the framework of vector-valued kernel ridge regression.
Wen-Bin Wang, Colin N. Jones· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.