Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

arXiv:2609.15179v1 Announce Type: cross Abstract: The Gaussian kernel is a widely used similarity measure underlying kernel methods such as kernel PCA and spectral clustering, but computing Gaussian kernel distances for many pairs of points can be expensive. Using Random Fourier Features (RFF), Chen and Phillips [ALT 2017] showed that for points in a d-dimensional Euclidean ball in {mathbb R}^N, t=Omega((d/arepsilon^2)log(dR/arepsilon)) features suffice to preserve all pairwise Gaussian kernel distances within a (1pmarepsilon) factor with high probability. We establish a uniform relative-error embedding theorem for the more general setting of an arbitrary positive-reach submanifold mathcal Msubset{mathbb R}^N of intrinsic dimension d. We show that t=O((d/arepsilon^2)log(operatorname{vol}(mathcal M)^2N^{2d}/(operatorname{vol}(B_1^d(0))^2operatorname{rch}(mathcal M)^{2d}arepsilon^{2d+1}elta))), or approximately O((d^2/arepsilon^2)(log N+log(1/(arepsilonelta)))), RFFs suffice, with probability 1-elta, to preserve the Gaussian kernel distance between every pair of manifold points up to relative error arepsilon. Thus the bound depends only logarithmically on the ambient dimension and on manifold parameters such as volume and reach, while retaining the 1/arepsilon^2 Euclidean rate. We also prove a topological consequence: under the same RFF embedding, persistent homology is preserved in the sense that weighted Cech and Rips filtrations built from Gaussian kernel power distance are (1pmarepsilon_star)-interleaved, where arepsilon_star accounts for both distance distortion and kernel-weight approximation.

Source: arXiv cs.LG | 2026-09-15