atlas

Research map / Learning theory and algorithms / Kernels and regression theory

Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees

ICML 2017 · Learning theory and algorithms › Kernels and regression theory · approach: Random feature approximation · 82 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
sample Fourier features from an upper bound on the ridge leverage function instead of the classic Fourier densityKernel ridge regression with shift-invariant kernels · Spectral approximation of the regularized kernel matrixnumber of Fourier features required: s = O(s_λ(K) log(s_λ(K)))Helped
use classic Fourier-density sampling rather than ridge-leverage-based samplingKernel ridge regression with the Gaussian kernel · Spectral approximation, including bounded datasets in the lower-bound constructionnumber of Fourier features required: s=Ω(n_λ / 2^{O(d)}); s=Ω(n_λ)Hurt
cap low-frequency sampling mass and allocate more samples to higher frequencies using the improved Gaussian-kernel distributionGaussian-kernel random Fourier features · Spectral approximation for datasets in an ℓ∞-ball of radius Rnumber of Fourier features required: s_{\bar{\tau}_R} = O\Big( (248R)^d \log(n_\lambda)^{d/2} + (200\log n_\lambda)^{2d}\Big)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy