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

An introduction to probability theory and its applications. Volume 1

William Feller · 1968

Earlier work this paper cites.

An operator pseudo-inversion lemma

Hidemitsu Ogawa · 1988

Earlier work this paper cites.

Optimal rates for the regularized least-squares algorithm

A. Caponnetto and E. De Vito · 2007

Earlier work this paper cites.

Random features for large-scale kernel machines

A. Rahimi and B. Recht · 2007

Earlier work this paper cites.

Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning

Ali Rahimi and Benjamin Recht · 2008

Earlier work this paper cites.

CUR matrix decompositions for improved data analysis

Michael W. Mahoney and Petros Drineas · 2009

Earlier work this paper cites.

Approximation Theory and Approximation Practice

Lloyd N. Trefethen · 2012

Earlier work this paper cites.

Sharp analysis of low-rank kernel matrix approximations

Francis R. Bach · 2013

Cited alongside, same era.

Subspace embeddings for the polynomial kernel

Haim Avron, Huy Nguyen, and David Woodruff · 2014

Cited alongside, same era.

Sketching as a tool for numerical linear algebra

David P. Woodruff · 2014

Cited alongside, same era.

Fast randomized kernel ridge regression with statistical guarantees

Ahmed El Alaoui and Michael W. Mahoney · 2015

Cited alongside, same era.

Less is more: Nyström computational regularization

Alessandro Rudi, Raffaello Camoriano, and Lorenzo Rosasco · 2015

Cited alongside, same era.

An introduction to matrix concentration inequalities

Joel A. Tropp · 2015

Cited alongside, same era.

Preconditioning kernel matrices

Kurt Cutajar, Michael Osborne, John Cunningham, and Maurizio Filippone · 2016

Later among the works it cites.

Faster kernel ridge regression using sketching and preconditioning

Haim Avron, Kenneth L. Clarkson, and David P. Woodruff · 2017

Later among the works it cites.

Random fourier features for kernel ridge regression: Approximation bounds and statistical guarantees

Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, and Amir Zandieh · 2017

Later among the works it cites.

On the equivalence between kernel quadrature rules and random feature expansions

Francis Bach · 2017

Later among the works it cites.

Input sparsity time low-rank approximation via ridge leverage score sampling

Michael B. Cohen, Cameron Musco, and Christopher Musco · 2017

Later among the works it cites.

Recursive sampling for the Nyström method