Fetching the paper…
Reading the bibliography…
We prove a new generalization bound that shows for any class of linear predictors in Gaussian space, the Rademacher complexity of the class and the training error under any continuous loss $\ell$ can control the test error under all Moreau envelopes of the loss $\ell$.
“Harmless interpolation of noisy data in regression”
Vidya Muthukumar, Kailas Vodrahalli, Vignesh Subramanian and Anant Sahai · 1903
Earlier work this paper cites.
“Benign overfitting in linear regression”
Peter. Bartlett, Philip. Long, Gábor Lugosi and Alexander Tsigler · 1906
Earlier work this paper cites.
“A model of double descent for high-dimensional binary linear classification”
Zeyu Deng, Abla Kammoun and Christos Thrampoulidis · 1911
Earlier work this paper cites.
Andrea Montanari, Feng Ruan, Youngtak Sohn and Jun Yan · 1911
Earlier work this paper cites.
Jeffrey Negrea, Gintare Dziugaite and Daniel. Roy · 1912
Earlier work this paper cites.
“On general minimax theorems.”
Maurice Sion · 1958
Earlier work this paper cites.
“Estimation of dependences based on empirical data”
Vladimir Vapnik · 1982
Earlier work this paper cites.
“Some inequalities for Gaussian processes and applications”
Yehoram Gordon · 1985
Earlier work this paper cites.
“Learnability and the Vapnik-Chervonenkis dimension”
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler and Manfred Warmuth · 1989
Earlier work this paper cites.
“Rademacher and Gaussian complexities: Risk bounds and structural results”
Peter. Bartlett and Shahar Mendelson · 2002
Earlier work this paper cites.
“Overfitting Can Be Harmless for Basis Pursuit: Only to a Degree”
Peizhong Ju, Xiaojun Lin and Jia Liu · 2002
Earlier work this paper cites.
Tengyuan Liang and Pragya Sur · 2002
Earlier work this paper cites.
“Some Extensions of an Inequality of Vapnik and Chervonenkis”
Dmitry Panchenko · 2002
Earlier work this paper cites.
“Noise-tolerant learning, the parity problem, and the statistical query model”
Avrim Blum, Adam Kalai and Hal Wasserman · 2003
Earlier work this paper cites.
“Convex optimization”
Stephen Boyd, Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
“Solving large scale linear prediction problems using stochastic gradient descent algorithms”
Tong Zhang · 2004
Earlier work this paper cites.
“Statistical behavior and consistency of classification methods based on convex risk minimization”
Tong Zhang · 2004
Earlier work this paper cites.
“Classification vs regression in overparameterized regimes: Does the loss function matter?”
Vidya Muthukumar, Adhyyan Narang, Vignesh Subramanian, Mikhail Belkin, Daniel Hsu and Anant Sahai · 2005
Earlier work this paper cites.
“Convexity, classification, and risk bounds”
Peter. Bartlett, Michael Jordan and Jon McAuliffe · 2006
Earlier work this paper cites.
“On Uniform Convergence and Low-Norm Interpolation Learning”
Lijia Zhou, Danica. Sutherland and Nathan Srebro · 2006
Earlier work this paper cites.
“Multiple Descent: Design Your Own Generalization Curve”
Lin Chen, Yifei Min, Mikhail Belkin and Amin Karbasi · 2008
Earlier work this paper cites.
“Universality Laws for High-Dimensional Learning with Random Features”
Hong Hu and Yue. Lu · 2009
Cited alongside, same era.
“Benign overfitting in ridge regression”, 2020
Alexander Tsigler and Peter. Bartlett · 2009
Cited alongside, same era.
“Optimistic Rates for Learning with a Smooth Loss”, 2010
Nathan Srebro, Karthik Sridharan and Ambuj Tewari · 2010
Cited alongside, same era.
“Convex analysis and monotone operator theory in Hilbert spaces”
Heinz Bauschke and Patrick Combettes · 2011
Cited alongside, same era.
“On the robustness of minimum-norm interpolators”, 2020
Geoffrey Chinot, Matthias Löffler and Sara van Geer · 2012
“Precise error analysis of regularized M M -estimators in high dimensions”
Christos Thrampoulidis, Ehsan Abbasi and Babak Hassibi · 2018
Later among the works it cites.
“High-dimensional probability: An introduction with applications in data science”
Roman Vershynin · 2018
Later among the works it cites.
“Reconciling modern machine learning practice and the bias-variance trade-off”
Mikhail Belkin, Daniel Hsu, Siyuan Ma and Soumik Mandal · 2019
Later among the works it cites.
“Mean estimation and regression under heavy-tailed distributions: A survey”
Gábor Lugosi and Shahar Mendelson · 2019
Later among the works it cites.
“Proximal mappings and Moreau envelopes of single-variable convex piecewise cubic functions and multivariable gauge functions”
Chayne Planiden and Xianfu Wang · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Optimal M-estimation in high-dimensional regression”
Derek Bean, Peter Bickel, Noureddine El and Bin Yu · 2013
Cited alongside, same era.
“On robust regression with high-dimensional predictors”
Noureddine El, Derek Bean, Peter Bickel, Chinghway Lim and Bin Yu · 2013
Cited alongside, same era.
“Learning subgaussian classes: Upper and minimax bounds”, 2013
Guillaume Lecué and Shahar Mendelson · 2013
Cited alongside, same era.
“Learning without concentration”
Shahar Mendelson · 2014
Cited alongside, same era.
“Analysis of boolean functions”
Ryan O’Donnell · 2014
Cited alongside, same era.
“Proximal algorithms”
Neal Parikh and Stephen Boyd · 2014
Cited alongside, same era.
“Understanding machine learning: From theory to algorithms”
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
“The impact of regularization on high-dimensional logistic regression”
Fariborz Salehi, Ehsan Abbasi and Babak Hassibi · 2019
Later among the works it cites.
“A modern maximum-likelihood theory for high-dimensional logistic regression”
Pragya Sur and Emmanuel Candès · 2019
Later among the works it cites.
“The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled chi-square”
Pragya Sur, Yuxin Chen and Emmanuel Candès · 2019
Later among the works it cites.
“The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression”
Emmanuel Candès and Pragya Sur · 2020
Later among the works it cites.
“On the Multiple Descent of Minimum-Norm Interpolants and Restricted Lower Isometry of Kernels”
Tengyuan Liang, Alexander Rakhlin and Xiyu Zhai · 2020
Later among the works it cites.
“Theoretical insights into multiclass classification: A high-dimensional asymptotic view”
Christos Thrampoulidis, Samet Oymak and Mahdi Soltanolkotabi · 2020
Later among the works it cites.
“Foolish Crowds Support Benign Overfitting”, 2021
Niladri. Chatterji and Philip. Long · 2021
Later among the works it cites.
“Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds and Benign Overfitting”
Frederic Koehler, Lijia Zhou, Danica. Sutherland and Nathan Srebro · 2021
Later among the works it cites.
“Minimum ℓ 1 \ell_{1} -norm interpolators: Precise asymptotics and multiple descent”, 2021
Yue Li and Yuting Wei · 2021
Later among the works it cites.
“Tight bounds for minimum l1-norm interpolation of noisy data”, 2021
Guillaume Wang, Konstantin Donhauser and Fanny Yang · 2021
Later among the works it cites.
Lijia Zhou, Frederic Koehler, Danica. Sutherland and Nathan Srebro · 2021
Later among the works it cites.
“Fast rates for noisy interpolation require rethinking the effects of inductive bias”, 2022
Konstantin Donhauser, Nicolo Ruggeri, Stefan Stojanovic and Fanny Yang · 2022
Closest in time.
“Universality of empirical risk minimization”
Andrea Montanari and Basil. Saeed · 2022
Closest in time.
“The Implicit Bias of Benign Overfitting”, 2022
Ohad Shamir · 2022
Closest in time.
“The asymptotic distribution of the MLE in high-dimensional logistic models: Arbitrary covariance”
Qian Zhao, Pragya Sur and Emmanuel Candes · 2022
Closest in time.
“Symmetrization approach to concentration inequalities for empirical processes”
Dmitry Panchenko · 2081
Closest in time.