Fetching the paper…
Reading the bibliography…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.
Random features for large-scale kernel machines
Ali Rahimi and Benjamin Recht · 2007
Earlier work this paper cites.
Uniform approximation of functions with random bases
Ali Rahimi and Benjamin Recht · 2008
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.
Concentration of the adjacency matrix and of the laplacian in random graphs with independent edges
Roberto Imbuzeiro Oliveira · 2009
Earlier work this paper cites.
The spectrum of kernel random matrices
Noureddine El Karoui · 2010
Earlier work this paper cites.
Machine learning: a probabilistic perspective
Kevin P Murphy · 2012
Earlier work this paper cites.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Earlier work this paper cites.
The spectrum of random inner-product kernel matrices
Xiuyuan Cheng and Amit Singer · 2013
Earlier work this paper cites.
A Mathematical Introduction to Compressive Sensing
Simon Foucart and Holger Rauhut · 2013
Earlier work this paper cites.
Sparse random feature algorithm as coordinate descent in hilbert space
Ian En-Hsu Yen, Ting-Wei Lin, Shou-De Lin, Pradeep K Ravikumar, and Inderjit S Dhillon · 2014
Earlier work this paper cites.
Interpolation via weighted ℓ 1 \ell_{1} minimization
Holger Rauhut and Rachel Ward · 2016
Earlier work this paper 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
Earlier work this paper cites.
Nonlinear random matrix theory for deep learning
Jeffrey Pennington and Pratik Worah · 2017
Earlier work this paper cites.
Generalization properties of learning with random features
Alessandro Rudi and Lorenzo Rosasco · 2017
Cited alongside, same era.
To understand deep learning we need to understand kernel learning
Mikhail Belkin, Siyuan Ma, and Soumik Mandal · 2018
Cited alongside, same era.
A random matrix approach to neural networks
Cosme Louart, Zhenyu Liao, and Romain Couillet · 2018
Cited alongside, same era.
High-Dimensional Probability: An Introduction with Applications in Data Science
Roman Vershynin · 2018
Cited alongside, same era.
Reconciling modern machine-learning practice and the classical bias–variance trade-off
Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal · 2019
Cited alongside, same era.
Eigenvalue distribution of nonlinear models of random matrices
Spectra of the conjugate kernel and neural tangent kernel for linear-width neural networks
Zhou Fan and Zhichao Wang · 2020
Later among the works it cites.
A random matrix analysis of random fourier features: beyond the gaussian kernel, a precise phase transition, and the corresponding double descent
Zhenyu Liao, Romain Couillet, and Michael W Mahoney · 2020
Later among the works it cites.
Random features for kernel approximation: A survey on algorithms, theory, and beyond
Fanghui Liu, Xiaolin Huang, Yudong Chen, and Johan AK Suykens · 2020
Later among the works it cites.
Sparse recovery with non-linear fourier features
Ayça Özçelikkale · 2020
Later among the works it cites.
On random matrices arising in deep neural networks: General iid case
L Pastur and V Slavin · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Lucas Benigni and Sandrine Péché · 2019
Cited alongside, same era.
The spectral norm of random inner-product kernel matrices
Zhou Fan and Andrea Montanari · 2019
Cited alongside, same era.
Sparse recovery for orthogonal polynomial transforms
Anna Gilbert, Albert Gu, Christopher Ré, Atri Rudra, and Mary Wootters · 2019
Cited alongside, same era.
Surprises in high-dimensional ridgeless least squares interpolation
Trevor Hastie, Andrea Montanari, Saharon Rosset, and Ryan J Tibshirani · 2019
Cited alongside, same era.
Towards a unified analysis of random fourier features
Zhu Li, Jean-Francois Ton, Dino Oglic, and Dino Sejdinovic · 2019
Cited alongside, same era.
The generalization error of random features regression: Precise asymptotics and the double descent curve
Song Mei and Andrea Montanari · 2019
Cited alongside, same era.
Two models of double descent for weak features
Mikhail Belkin, Daniel Hsu, and Ji Xu · 2020
Cited alongside, same era.
On random matrices arising in deep neural networks. gaussian case
Leonid Pastur · 2020
Later among the works it cites.
Conditioning of random feature matrices: Double descent and generalization error
Zhijun Chen and Hayden Schaeffer · 2021
Later among the works it cites.
Generalization bounds for sparse random feature expansions
Abolfazl Hashemi, Hayden Schaeffer, Robert Shi, Ufuk Topcu, Giang Tran, and Rachel Ward · 2021
Later among the works it cites.
Zhichao Wang and Yizhe Zhu · 2021
Later among the works it cites.
Shrimp: Sparser random feature models via iterative magnitude pruning
Yuege Xie, Bobby Shi, Hayden Schaeffer, and Rachel Ward · 2021
Later among the works it cites.
SRMD: Sparse random mode decomposition
Nicholas Richardson, Hayden Schaeffer, and Giang Tran · 2022
Closest in time.
Harfe: Hard-ridge random feature expansion
Esha Saha, Hayden Schaeffer, and Giang Tran · 2022
Closest in time.