atlas

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

On The Relative Error of Random Fourier Features for Preserving Kernel Distance

ICLR 2023 · Learning theory and algorithms › Kernels and regression theory · approach: Random feature approximation · 0 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
Use RFF on analytic shift-invariant kernels (e.g., Gaussian) instead of general shift-invariant kernelsRFF for kernel distance · theory (relative error of kernel distance)relative error preservation with poly(eps^-1 log n) dimensionsHelped
Use RFF on Laplacian kernels (non-analytic at origin) instead of analytic kernelsRFF for kernel distance · theory (lower bound, (Delta,rho)-bounded inputs)required target dimension for constant relative errorHurt
Oblivious embedding via l1 to squared-l2 embedding plus RFF on Gaussian kernel (New-Lap) for Laplacian kernelsLaplacian kernel distance · theory (target dimension)target dimension for relative errorHelped
Nystrom (SVD low-rank approximation) as baseline for kernel distancekernel distance preservation · synthetic Gaussian data, relative errorrelative errorHurt

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