SOURCE-LINKED INTELLIGENCE

Signed random Fourier features for fast density estimation with indefinite kernels

arXiv · AI, language, vision and robotics · article · Aug 29, 2026 · UTC

Kernel density estimation (KDE) is one of the most fundamental statistical estimators of density functions. Its direct implementation on a dataset of $N$ points incurs an $\mathcal{O}(N^{2})$ computational cost, which is prohibitive for large-scale datasets. Kernel approximation techniques can be applied to bring the computational cost down to $\mathcal{O}(N)$. The random Fourier features (RFF) technique, based on sampling from the spectral density of the kernel function, has become popular to speed up kernel estimators for machine learning applications. Unfortunately, it is restricted to posi

Read original source ↗ Open in workspace

recordType

paper

region

Global