The Error Probability of Random Fourier Features is Dimensionality Independent

Abstract

We show that the error probability of reconstructing kernel matrices from Random Fourier Features for the Gaussian kernel function is at most O(R2/3 (-D)), where D is the number of random features and R is the diameter of the data domain. We also provide an information-theoretic method-independent lower bound of ((1-(-R2)) (-D)). Compared to prior work, we are the first to show that the error probability for random Fourier features is independent of the dimensionality of data points. As applications of our theory, we obtain dimension-independent bounds for kernel ridge regression and support vector machines.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…