Fetching the paper…
Reading the bibliography…
Deep learning methods operate in regimes that defy the traditional statistical mindset.
Szegő, Gabor, Orthogonal polynomials , vol. 23, American Mathematical Soc., 1939
1939
Earlier work this paper cites.
Ronald A DeVore, Ralph Howard, and Charles Micchelli, Optimal nonlinear approximation , Manuscripta mathematica 63
1989
Earlier work this paper cites.
David L Donoho and Iain M Johnstone, Projection-based approximation and a duality with kernel methods , The Annals of Statistics (1989), 58–106
1989
Earlier work this paper cites.
Radford M Neal, Priors for infinite networks , Bayesian Learning for Neural Networks, Springer, 1996, pp. 29–53
1996
Earlier work this paper cites.
Christopher KI Williams, Computing with infinite networks , Advances in neural information processing systems, 1997, pp. 295–301
1997
Earlier work this paper cites.
Yuan Yao, Lorenzo Rosasco, and Andrea Caponnetto, On early stopping in gradient descent learning , Constructive Approximation 26
2007
Earlier work this paper cites.
Ali Rahimi and Benjamin Recht, Random features for large-scale kernel machines , Advances in neural information processing systems, 2008, pp. 1177–1184
2008
Earlier work this paper cites.
Greg W. Anderson, Alice Guionnet, and Ofer Zeitouni, An introduction to random matrices , Cambridge University Press, 2009
2009
Earlier work this paper cites.
Trevor Hastie, Robert Tibshirani, and Jerome Friedman, The elements of statistical learning , Springer, 2009
2009
Earlier work this paper cites.
Zhidong Bai and Jack W Silverstein, Spectral analysis of large dimensional random matrices , vol. 20, Springer, 2010
2010
Earlier work this paper cites.
Noureddine El Karoui, The spectrum of kernel random matrices , The Annals of Statistics 38
2010
Earlier work this paper cites.
Theodore S Chihara, An introduction to orthogonal polynomials , Courier Corporation, 2011
2011
Earlier work this paper cites.
Domenico Marinucci and Giovanni Peccati, Random fields on the sphere: representation, limit theorems and cosmological applications , vol. 389, Cambridge University Press, 2011
2011
Earlier work this paper cites.
Francis Bach, Sharp analysis of low-rank kernel matrix approximations , Conference on Learning Theory, 2013, pp. 185–209
2013
Earlier work this paper cites.
Xiuyuan Cheng and Amit Singer, The spectrum of random inner-product kernel matrices , Random Matrices: Theory and Applications 2
2013
Earlier work this paper cites.
Costas Efthimiou and Christopher Frye, Spherical harmonics in p dimensions , World Scientific, 2014
2014
Earlier work this paper cites.
Ahmed Alaoui and Michael W Mahoney, Fast randomized kernel ridge regression with statistical guarantees , Advances in Neural Information Processing Systems, 2015, pp. 775–783
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
Amit Daniely, Roy Frostig, and Yoram Singer, Toward deeper understanding of neural networks: The power of initialization and a dual view on expressivity , Advances In Neural Information Processing Systems, 2016, pp. 2253–2261
2016
Earlier work this paper cites.
Yash Deshpande and Andrea Montanari, Sparse pca via covariance thresholding , Journal of Machine Learning Research 17
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
2017
Earlier work this paper cites.
Amit Daniely, Sgd learns the conjugate kernel class of the network , Advances in Neural Information Processing Systems, 2017, pp. 2422–2430
2017
Cited alongside, same era.
2017
Cited alongside, same era.
Jeffrey Pennington and Pratik Worah, Nonlinear random matrix theory for deep learning , Advances in Neural Information Processing Systems, 2017, pp. 2637–2646
2017
Cited alongside, same era.
Alessandro Rudi and Lorenzo Rosasco, Generalization properties of learning with random features , Advances in Neural Information Processing Systems, 2017, pp. 3215–3225
2017
Cited alongside, same era.
2018
Later among the works it cites.
2019
Closest in time.
2019
Closest in time.
Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal, Reconciling modern machine learning and the bias-variance trade-off , Proceedings of the National Academy of Sciences 116
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J William Helton, Tobias Mai, and Roland Speicher, Applications of realizations (aka linearizations) to free probability , Journal of Functional Analysis 274
2018
Cited alongside, same era.
2019
Closest in time.
Mikhail Belkin, Alexander Rakhlin, and Alexandre B Tsybakov, Does data interpolation contradict statistical optimality? , The 22nd International Conference on Artificial Intelligence and Statistics, 2019, pp. 1611–1619
2019
Closest in time.
2019
Closest in time.
Zhou Fan and Andrea Montanari, The spectral norm of random inner-product kernel matrices , Probability Theory and Related Fields 173
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
Grant Rotskoff, Samy Jelassi, Joan Bruna, and Eric Vanden-Eijnden, Neuron birth-death dynamics accelerates gradient descent and converges asymptotically , International Conference on Machine Learning, 2019, pp. 5508–5517
2019
Closest in time.
Justin Sirignano and Konstantinos Spiliopoulos, Mean field analysis of neural networks: A central limit theorem , Stochastic Processes and their Applications (2019)
2019
Closest in time.
Peter L Bartlett, Philip M Long, Gábor Lugosi, and Alexander Tsigler, Benign overfitting in linear regression , Proceedings of the National Academy of Sciences (2020)
2020
Closest in time.