A spectral mixture representation of isotropic kernels with application to random Fourier features
Nicolas Langren\'e, Xavier Warin, Pierre Gruet

TL;DR
This paper introduces a spectral mixture representation for isotropic kernels, enabling simple spectral sampling formulas for a broad class of kernels, thus enhancing the applicability of Random Fourier Features in machine learning.
Contribution
It provides a constructive spectral decomposition of isotropic kernels as scale mixtures of stable distributions, expanding RFF applicability beyond Gaussian kernels.
Findings
Spectral distributions are scale mixtures of Gaussian distributions.
New spectral sampling formulas for various kernels like Matérn and Cauchy.
Broad applications in kernel methods such as SVMs and Gaussian processes.
Abstract
Rahimi and Recht (2007) introduced the idea of decomposing positive definite shift-invariant kernels by randomly sampling from their spectral distribution for machine learning applications. This famous technique, known as Random Fourier Features (RFF), is in principle applicable to any such kernel whose spectral distribution can be identified and simulated. In practice, however, it is usually applied to the Gaussian kernel because of its simplicity, since its spectral distribution is also Gaussian. Clearly, simple spectral sampling formulas would be desirable for broader classes of kernels. In this paper, we show that the spectral distribution of positive definite isotropic kernels in for all can be decomposed as a scale mixture of -stable random vectors, and we identify the mixing distribution as a function of the kernel. This constructive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
