Fetching the paper…
Reading the bibliography…
Maximum margin binary classification is one of the most fundamental algorithms in machine learning, yet the role of featurization maps and the high-dimensional asymptotics of the misclassification error for non-Gaussian features are still poorly understood.
Elizabeth Gardner, The space of interactions in neural network models , Journal of physics A: Mathematical and general 21
1988
Earlier work this paper cites.
Yehoram Gordon, On Milman’s inequality and random subspaces which escape through a mesh in R n R^{n} , Geometric Aspects of Functional Analysis, Springer, 1988, pp. 84–106
1988
Earlier work this paper cites.
Mariya Shcherbina and Brunello Tirozzi, Rigorous solution of the Gardner problem , Communications in Mathematical Physics 234
2003
Earlier work this paper cites.
Maria-Florina Balcan, Avrim Blum, and Santosh Vempala, Kernels as features: On kernels, margins, and low-dimensional mappings , Machine Learning 65
2006
Earlier work this paper cites.
Emmanuel J Candes and Terence Tao, Near-optimal signal recovery from random projections: Universal encoding strategies? , IEEE transactions on information theory 52
2006
Earlier work this paper cites.
David L Donoho, For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution , Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences 59
2006
Earlier work this paper cites.
Ali Rahimi and Benjamin Recht, Random features for large-scale kernel machines , Advances in neural information processing systems 20
2007
Earlier work this paper cites.
Cédric Villani, Optimal transport: old and new , vol. 338, Springer Science & Business Media, 2008
2008
Earlier work this paper cites.
Sourav Chatterjee, Fluctuations of eigenvalues and second order poincaréinequalities , Probability Theory and Related Fields 143
2009
Earlier work this paper cites.
Zhidong Bai and Jack Silverstein, Spectral Analysis of Large Dimensional Random Matrices ( 2 n d 2^{nd} edition) , Springer, 2010
2010
Earlier work this paper cites.
Satish Babu Korada and Andrea Montanari, Applications of the lindeberg principle in communications and statistical learning , IEEE transactions on information theory 57
2011
Earlier work this paper cites.
Mihailo Stojnic, Another look at the Gardner problem , arXiv:1306.3979 (2013)
2013
Earlier work this paper cites.
Shai Shalev-Shwartz and Shai Ben-David, Understanding machine learning: From theory to algorithms , Cambridge University Press, 2014
2014
Earlier work this paper cites.
Christos Thrampoulidis, Samet Oymak, and Babak Hassibi, Regularized linear regression: A precise analysis of the estimation error , Proceedings of The 28th Conference on Learning Theory (Paris, France), Proceedings of Machine Learning Research, vol. 40, PMLR, 03–06 Jul 2015, pp. 1683–1709
2015
Earlier work this paper cites.
Andrea Montanari and Phan-Minh Nguyen, Universality of the elastic net error , 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017, pp. 2338–2342
2017
Earlier work this paper cites.
Jeffrey Pennington and Pratik Worah, Nonlinear random matrix theory for deep learning , Advances in neural information processing systems 30
2017
Earlier work this paper cites.
Mikhail Belkin, Daniel J Hsu, and Partha Mitra, Overfitting or perfect fitting? risk bounds for classification and regression rules that interpolate , Advances in Neural Information Processing Systems, 2018, pp. 2300–2311
2018
Earlier work this paper cites.
Simon S Du, Xiyu Zhai, Barnabas Poczos, and Aarti Singh, Gradient descent provably optimizes over-parameterized neural networks , International Conference on Learning Representations, 2018
2018
Cited alongside, same era.
Samet Oymak and Joel A Tropp, Universality laws for randomized dimension reduction, with applications , Information and Inference: A Journal of the IMA 7
2018
Cited alongside, same era.
Daniel Soudry, Elad Hoffer, Mor Shpigel Nacson, Suriya Gunasekar, and Nathan Srebro, The implicit bias of gradient descent on separable data , The Journal of Machine Learning Research 19
2018
Cited alongside, same era.
Roman Vershynin, High-dimensional probability: An introduction with applications in data science , vol. 47, Cambridge university press, 2018
2018
Cited alongside, same era.
Frederic Koehler, Lijia Zhou, Danica J Sutherland, and Nathan Srebro, Uniform convergence of interpolators: Gaussian width, norm bounds and benign overfitting , Advances in Neural Information Processing Systems 34
2021
Later among the works it cites.
Bruno Loureiro, Cedric Gerbelot, Hugo Cui, Sebastian Goldt, Florent Krzakala, Marc Mezard, and Lenka Zdeborová, Learning curves of generic features maps for realistic datasets with a teacher-student model , Advances in Neural Information Processing Systems 34
2021
Later among the works it cites.
Spencer Frei, Niladri S Chatterji, and Peter Bartlett, Benign overfitting without linearity: Neural network classifiers trained by gradient descent for noisy linear data , Conference on Learning Theory, PMLR, 2022, pp. 2668–2703
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
2019
Cited alongside, same era.
Samet Oymak and Mahdi Soltanolkotabi, Overparameterized nonlinear learning: Gradient descent takes the shortest path? , International Conference on Machine Learning, PMLR, 2019, pp. 4951–4960
2019
Cited alongside, same era.
2019
Cited alongside, same era.
Pragya Sur and Emmanuel J Candès, A modern maximum-likelihood theory for high-dimensional logistic regression , Proceedings of the National Academy of Sciences 116
2019
Cited alongside, same era.
Martin J Wainwright, High-dimensional statistics: A non-asymptotic viewpoint , vol. 48, Cambridge University Press, 2019
2019
Cited alongside, same era.
Peter L Bartlett, Philip M Long, Gábor Lugosi, and Alexander Tsigler, Benign overfitting in linear regression , Proceedings of the National Academy of Sciences 117
2020
Cited alongside, same era.
Emmanuel J Candès and Pragya Sur, The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression , The Annals of Statistics 48
2020
Cited alongside, same era.
2022
Later among the works it cites.
Hong Hu and Yue M. Lu, Universality laws for high-dimensional learning with random features , IEEE Transactions on Information Theory (2022), 1–1
2022
Later among the works it cites.
Trevor Hastie, Andrea Montanari, Saharon Rosset, and Ryan J Tibshirani, Surprises in high-dimensional ridgeless least squares interpolation , The Annals of Statistics 50
2022
Later among the works it cites.
Adel Javanmard and Mahdi Soltanolkotabi, Precise statistical analysis of classification accuracies for adversarial training , The Annals of Statistics 50
2022
Later among the works it cites.
Tengyuan Liang and Pragya Sur, A precise high-dimensional asymptotic theory for boosting and minimum-l1-norm interpolated classifiers , The Annals of Statistics 50
2022
Later among the works it cites.
Song Mei and Andrea Montanari, The generalization error of random features regression: Precise asymptotics and the double descent curve , Communications on Pure and Applied Mathematics 75
2022
Later among the works it cites.
Andrea Montanari and Basil N Saeed, Universality of empirical risk minimization , Conference on Learning Theory, PMLR, 2022, pp. 4310–4312
2022
Later among the works it cites.
Andrea Montanari and Yiqiao Zhong, The interpolation phase transition in neural networks: Memorization and generalization under lazy training , The Annals of Statistics 50
2022
Later among the works it cites.
Lijia Zhou, Frederic Koehler, Pragya Sur, Danica J. Sutherland, and Nathan Srebro, A non-asymptotic moreau envelope theory for high-dimensional generalized linear models , Advances in Neural Information Processing Systems 35
2022
Later among the works it cites.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Alexander Tsigler and Peter L. Bartlett, Benign overfitting in ridge regression , Journal of Machine Learning Research 24
2023
Closest in time.