Random feature

Random features (RF) are a technique used in machine learning to approximate kernel methods, introduced by Ali Rahimi and Ben Recht in their 2007 paper "Random Features for Large-Scale Kernel Machines", and extended by. RF uses a Monte Carlo approximation to kernel functions by randomly sampled feature maps. It is used for datasets that are too large for traditional kernel methods like support vector machine, kernel ridge regression, and gaussian process.

Mathematics

Kernel method

Template:Main Given a feature map $\varphi :{ℝ}^d\to V$, where $V$ is a Hilbert space (more specifically, a reproducing kernel Hilbert space), the kernel trick replaces inner products in feature space $$⟨\varphi (x_i),\varphi (x_j){⟩}_V$$ by a kernel function$$k(x_i,x_j):{ℝ}^d\times {ℝ}^d\to ℝ$$Kernel methods replaces linear operations in high-dimensional space by operations on the kernel matrix: $$K_X:=[k(x_i,x_j){]}_{i,j\in 1:N}$$ where $N$ is the number of data points.

Random kernel method

The problem with kernel methods is that the kernel matrix $K_X$ has size $N\times N$. This becomes computationally infeasible when $N$ reaches the order of a million. The random kernel method replaces the kernel function $k$ by an inner product in low-dimensional feature space ${ℝ}^D$:$$k(x,y)\approx ⟨z(x),z(y)⟩$$ where $z$ is a randomly sampled feature map $z:{ℝ}^d\to {ℝ}^D$.

This converts kernel linear regression into linear regression in feature space, kernel SVM into SVM in feature space, etc. Since we have $K_X\approx Z_X^T{Z}_X$ where $Z_X=[z(x_1),\dots ,z(x_N)]$, these methods no longer involve matrices of size $O(N^2)$, but only random feature matrices of size $O(DN)$.

Random Fourier feature

Radial basis function kernel

Template:Main The radial basis function (RBF) kernel on two samples $x_i,x_j\in {ℝ}^d$ is defined as

$k(x_i,x_j)=\exp (-\frac{\Vert x_i-x_j{\Vert }^2}{2{\sigma }^2})$

where $\Vert x_i-x_j{\Vert }^2$ is the squared Euclidean distance and $\sigma$ is a free parameter defining the shape of the kernel. It can be approximated by a random Fourier feature map $z:{ℝ}^d\to {ℝ}^{2D}$:$$z(x):=\frac{1}{\sqrt{D}}[\cos ⟨{\omega }_1,x⟩,\sin ⟨{\omega }_1,x⟩,\dots ,\cos ⟨{\omega }_D,x⟩,\sin ⟨{\omega }_D,x⟩{]}^T$$where ${\omega }_1,...,{\omega }_D$ are IID samples from the multidimensional normal distribution $N(0,{\sigma }^{-2}I)$.

Template:Math proofSince $\cos ,\sin$ are bounded, there is a stronger convergence guarantee by Hoeffding's inequality.Template:Pg

Random Fourier features

By Bochner's theorem, the above construction can be generalized to arbitrary positive definite shift-invariant kernel $k(x,y)=k(x-y)$.

Define its Fourier transform$$p(\omega )=\frac{1}{2\pi }\underset{{ℝ}^d}{\int }{e}^{-j⟨\omega ,\mathrm{\Delta }⟩}k(\mathrm{\Delta })d\mathrm{\Delta }$$then ${\omega }_1,...,{\omega }_D$ are sampled IID from the probability distribution with probability density $p$. This applies for other kernels like the Laplace kernel and the Cauchy kernel.

Neural network interpretation

Template:See also Given a random Fourier feature map $z$, training the feature on a dataset by featurized linear regression is equivalent to fitting complex parameters ${\theta }_1,\dots ,{\theta }_D\in ℂ$ such that$$f_{\theta }(x)=\mathrm{R}\mathrm{e}\left(\sum _k{\theta }_k{e}^{i⟨{\omega }_k,x⟩}\right)$$which is a neural network with a single hidden layer, with activation function $t\mapsto e^{it}$, zero bias, and the parameters in the first layer frozen.

In the overparameterized case, when $2D\ge N$, the network linearly interpolates the dataset $\{(x_i,y_i){\}}_{i\in 1:N}$, and the network parameters is the least-norm solution:$$\hat{\theta }=\arg \underset{\theta \in {ℂ}^D,f_{\theta }(x_k)=y_k\mathrm{\forall }k\in 1:N}{\min }\Vert \theta \Vert$$At the limit of $D\to \mathrm{\infty }$, the L2 norm $\Vert \hat{\theta }\Vert \to \Vert f_K{\Vert }_H$ where $f_K$ is the interpolating function obtained by the kernel regression with the original kernel, and $\Vert \cdot {\Vert }_H$ is the norm in the reproducing kernel Hilbert space for the kernel.

Other examples

Random binning features

A random binning features map partitions the input space using randomly shifted grids at randomly chosen resolutions and assigns to an input point a binary bit string that corresponds to the bins in which it falls. The grids are constructed so that the probability that two points $x_i,x_j\in {ℝ}^d$ are assigned to the same bin is proportional to $K(x_i,x_j)$. The inner product between a pair of transformed points is proportional to the number of times the two points are binned together, and is therefore an unbiased estimate of $K(x_i,x_j)$. Since this mapping is not smooth and uses the proximity between input points, Random Binning Features works well for approximating kernels that depend only on the $L_1$ distance between datapoints.

Orthogonal random features

Orthogonal random features uses a random orthogonal matrix instead of a random Fourier matrix.

Historical context

In NIPS 2006, deep learning had just become competitive with linear models like PCA and linear SVMs for large datasets, and people speculated about whether it could compete with kernel SVMs. However, there was no way to train kernel SVM on large datasets. The two authors developed the random feature method to train those.

It was then found that the $O(1/D)$ variance bound did not match practice: the variance bound predicts that approximation to within $0.01$ requires $D\sim 10^4$, but in practice required only $\sim 10^2$. Attempting to discover what caused this led to the subsequent two papers.

See also

• Kernel method
• Support vector machine
• Fourier transform
• Monte Carlo method

External links

• Random Walks - Random Fourier features