Madhu S. Advani, Andrew M. Saxe, and Haim Sompolinsky, “High-dimensional dynamics of generalization error in neural networks,” Neural Networks 132
2020
Closest in time.
Jimmy Ba, Murat Erdogdu, Taiji Suzuki, Denny Wu, and Tianzong Zhang, “Generalization of Two-layer Neural Networks: An Asymptotic Viewpoint,” International Conference on Learning Representations (ICLR) (2020)
2020
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 117
2020
Closest in time.
Mikhail Belkin, Daniel Hsu, and Ji Xu, “Two Models of Double Descent for Weak Features,” SIAM Journal on Mathematics of Data Science 2
2020
Closest in time.
Zeyu Deng, Abla Kammoun, and Christos Thrampoulidis, “A Model of Double Descent for High-Dimensional Logistic Regression,” IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , 4267–4271 (2020)
2020
Closest in time.
Michał Dereziński, Feynman Liang, and Michael W. Mahoney, “Exact expressions for double descent and implicit regularization via surrogate random design,” Advances in Neural Information Processing Systems (NeurIPS) 33
2020
Closest in time.
Federica Gerace, Bruno Loureiro, Florent Krzakala, Marc Mézard, and Lenka Zdeborová, “Generalisation error in learning with random features and the hidden manifold model,” Proceedings of the 37th International Conference on Machine Learning (ICML) PMLR, 119
2020
Closest in time.
Arthur Jacot, Berfin Şimşek, Francesco Spadaro, Clément Hongler, and Franck Gabriel, “Implicit regularization of random feature models,” Proceedings of the 37th International Conference on Machine Learning (ICML) PMLR, 119
2020
Closest in time.
Ganesh Ramachandra Kini and Christos Thrampoulidis, “Analytic Study of Double Descent in Binary Classification: The Impact of Loss,” IEEE International Symposium on Information Theory (ISIT) , 2527–2532 (2020)
2020
Closest in time.
Tengyuan Liang and Alexander Rakhlin, “Just interpolate: Kernel “Ridgeless” regression can generalize,” Annals of Statistics 48
2020
Closest in time.
Tengyuan Liang, Alexander Rakhlin, and Xiyu Zhai, “On the Multiple Descent of Minimum-Norm Interpolants and Restricted Lower Isometry of Kernels,” Proceedings of Thirty Third Conference on Learning Theory PMLR, 125
2020
Closest in time.
Zhenyu Liao, Romain Couillet, and Michael W Mahoney, “A random matrix analysis of random Fourier features: beyond the Gaussian kernel, a precise phase transition, and the corresponding double descent,” Advances in Neural Information Processing Systems (NeurIPS) 33
2020
Closest in time.
Zitong Yang, Yaodong Yu, Chong You, Jacob Steinhardt, and Yi Ma, “Rethinking Bias-Variance Trade-off for Generalization of Neural Networks,” Proceedings of the 37th International Conference on Machine Learning (ICML) PMLR, 119
2020
Closest in time.
Sebastian Goldt, Marc Mézard, Florent Krzakala, and Lenka Zdeborová, “Modeling the Influence of Data Structure on Learning in Neural Networks: The Hidden Manifold Model,” Physical Review X 10
2020
Closest in time.
Carlo Baldassi, Enrico M. Malatesta, Matteo Negri, and Riccardo Zecchina, “Wide flat minima and optimal generalization in classifying high-dimensional Gaussian mixtures,” Journal of Statistical Mechanics: Theory and Experiment 2020
2020
Closest in time.
Sho Yaida, “Non-Gaussian processes and neural networks at finite widths,” Proceedings of The First Mathematical and Scientific Machine Learning Conference PMLR, 107
2020
Closest in time.
Licong Lin and Edgar Dobriban, “What causes the test error? Going beyond bias-variance via ANOVA,” Journal of Machine Learning Research 22
2021
Closest in time.
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 (2021), 10.1002/cpa.22008
2021
Closest in time.
Jason W. Rocks and Pankaj Mehta, “The Geometry of Over-parameterized Regression and Adversarial Perturbations,” (2021), arXiv:2103.14108
Original
2021
Closest in time.
Fabrizio Pittorino, Carlo Lucibello, Christoph Feinauer, Enrico M. Malatesta, Gabriele Perugini, Carlo Baldassi, Matteo Negri, Elizaveta Demyanenko, and Riccardo Zecchina, “Entropic gradient descent algorithms and wide flat minima,” International Conference on Learning Representations (ICLR) (2021)
2021
Closest in time.