arXiv Machine Learning July 27, 2026 By Sergio A. Alvarez

Data eccentricity, asymptotics of Gaussian RBF reproducing kernel Hilbert space, and kernel PCA

Read the original on arXiv Machine Learning →

arXiv:2607. 21823v1 Announce Type: new Abstract: We show that, up to isotropic scaling, the Gaussian RBF reproducing kernel Hilbert space (RKHS) is asymptotically isometric to Euclidean space in the large bandwidth limit.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Sep 15

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...

By Soumik Dutta, Kunal Dutta

rag

arXiv Machine Learning

Jun 11

Bernstein-Schur Kernels: Random Features by Sketched Modulation and Radial Randomization

arXiv:2606. 11255v1 Announce Type: new Abstract: Bernstein--Schur kernels are products of a finite-feature kernel (one with an explicit finite-dimensional feature map) and a completely monotone shift-invariant kernel: nonstationary kernels that fall between the shift-invariant and dot-product templates random features usually exploit, so in general neither Bochner sampling nor polynomial sketching applies to the full kernel directly.

By Taha Bouhsine

arXiv Machine Learning

Aug 11

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

arXiv:2608. 08704v1 Announce Type: cross Abstract: Kernel spectral clustering with a single bandwidth can be inadequate for data exhibiting multiple characteristic pairwise-distance scales, a problem particularly prevalent in the high-dimensional regime.

By Zeqin Lin, Guangming Pan, Zhixiang Zhang, Yinbing Zhou

rag

arXiv Machine Learning

Sep 3

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models

arXiv:2609. 02155v1 Announce Type: new Abstract: The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal.

By Piyush Sao

arXiv Machine Learning

Sep 22

On Kernel Eigen-alignments of KRR: Reconstruction and Generalization

arXiv:2605.15240v2 Announce Type: replace-cross Abstract: This paper investigates the critical role of eigenalignments between the kernel matrix and learning targets in achieving robust generalizatio...

By Yang Liu, Ernest Fokoue, Richard Lange, Daniel Krutz

safety

arXiv Machine Learning

Sep 1

Signed random Fourier features for fast density estimation with indefinite kernels

arXiv:2608.29265v1 Announce Type: cross Abstract: Kernel density estimation (KDE) is one of the most fundamental statistical estimators of density functions. Its direct implementation on a dataset of...

By Xie Wang, Nicolas Langren\'e, Wen Chen

One email a morning, machine-written

Related stories

Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

Bernstein-Schur Kernels: Random Features by Sketched Modulation and Radial Randomization

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models

On Kernel Eigen-alignments of KRR: Reconstruction and Generalization

Signed random Fourier features for fast density estimation with indefinite kernels