Fetching the paper…
Reading the bibliography…
We consider a model for logistic regression where only a subset of features of size $p$ is used for training a linear classifier over $n$ training samples.
On general minimax theorems
Maurice Sion et al · 1958
Earlier work this paper cites.
Cox’s regression model for counting processes: a large sample study
Per Kragh Andersen and Richard D Gill · 1982
Earlier work this paper cites.
How many variables should be entered in a regression equation?
Leo Breiman and David Freedman · 1983
Earlier work this paper cites.
On Milman’s inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n}
Yehoram Gordon · 1988
Earlier work this paper cites.
A first course in optimization theory
R. K. Sundaram · 1996
Earlier work this paper cites.
Convex analysis
R Tyrell Rockafellar · 1997
Earlier work this paper cites.
Convexity, classification, and risk bounds
Peter L Bartlett, Michael I Jordan, and Jon D McAuliffe · 2006
Earlier work this paper cites.
Sparse reconstruction by convex relaxation: Fourier and gaussian measurements
Mark Rudelson and Roman Vershynin · 2006
Earlier work this paper cites.
Gaussian processes for machine learning
Christopher KI Williams and Carl Edward Rasmussen · 2006
Earlier work this paper cites.
Convex optimization
Stephen Boyd and Lieven Vandenberghe · 2009
Earlier work this paper cites.
Variational analysis
R Tyrrell Rockafellar and Roger J-B Wets · 2009
Earlier work this paper cites.
Various thresholds for ℓ 1 \ell_{1} -optimization in compressed sensing
Mihailo Stojnic · 2009
Earlier work this paper cites.
The noise-sensitivity phase transition in compressed sensing
David L Donoho, Arian Maleki, and Andrea Montanari · 2011
Earlier work this paper cites.
Generalized approximate message passing for estimation with random linear mixing
Sundeep Rangan · 2011
Earlier work this paper cites.
The lasso risk for gaussian matrices
Mohsen Bayati and Andrea Montanari · 2012
Earlier work this paper cites.
The convex geometry of linear inverse problems
Venkat Chandrasekaran, Benjamin Recht, Pablo A Parrilo, and Alan S Willsky · 2012
Earlier work this paper cites.
Living on the edge: A geometric theory of phase transitions in convex optimization
Dennis Amelunxen, Martin Lotz, Michael B McCoy, and Joel A Tropp · 2013
Earlier work this paper cites.
The squared-error of generalized lasso: A precise analysis
Samet Oymak, Christos Thrampoulidis, and Babak Hassibi · 2013
Earlier work this paper cites.
A framework to characterize performance of lasso algorithms
Mihailo Stojnic · 2013
Earlier work this paper cites.
Margins, shrinkage and boosting
Matus Telgarsky · 2013
Earlier work this paper cites.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Earlier work this paper cites.
The generalized lasso with non-linear observations
Yaniv Plan and Roman Vershynin · 2015
Earlier work this paper cites.
Lasso with non-linear measurements is equivalent to one with linear measurements
Christos Thrampoulidis, Ehsan Abbasi, and Babak Hassibi · 2015
Earlier work this paper cites.
Regularized linear regression: A precise analysis of the estimation error
Christos Thrampoulidis, Samet Oymak, and Babak Hassibi · 2015
Cited alongside, same era.
High dimensional robust m-estimation: Asymptotic variance via approximate message passing
David Donoho and Andrea Montanari · 2016
Cited alongside, same era.
High-dimensional estimation of structured signals from non-linear observations with general convex loss functions
Martin Genzel · 2016
Cited alongside, same era.
Asymptotic behavior of support vector machine for spiked population model
Hanwen Huang · 2017
Cited alongside, same era.
Universality laws for randomized dimension reduction, with applications
Samet Oymak and Joel A Tropp · 2017
Cited alongside, same era.
Overfitting or perfect fitting? risk bounds for classification and regression rules that interpolate
The implicit bias of gradient descent on nonseparable data
Ziwei Ji and Matus Telgarsky · 2019
Closest in time.
Optimal ridge penalty for real-world high-dimensional data can be zero or negative due to the implicit ridge regularization
Dmitry Kobak, Jonathan Lomond, and Benoit Sanchez · 2019
Closest in time.
A large scale analysis of logistic regression: asymptotic performance and new insights
X. Mai, Z. Liao, and R. Couillet · 2019
Closest in time.
A large scale analysis of logistic regression: Asymptotic performance and new insights
Xiaoyi Mai, Zhenyu Liao, and Romain Couillet · 2019
Closest in time.
The generalization error of random features regression: Precise asymptotics and double descent curve
Song Mei and Andrea Montanari · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mikhail Belkin, Daniel J Hsu, and Partha Mitra · 2018
Cited alongside, same era.
Reconciling modern machine learning and the bias-variance trade-off
Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal · 2018
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.
Does data interpolation contradict statistical optimality?
Mikhail Belkin, Alexander Rakhlin, and Alexandre B Tsybakov · 2018
Cited alongside, same era.
Emmanuel J Candès and Pragya Sur · 2018
Cited alongside, same era.
Phase retrieval via polytope optimization: Geometry, phase transitions, and new algorithms
Oussama Dhifallah, Christos Thrampoulidis, and Yue M Lu · 2018
Cited alongside, same era.
On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
Noureddine El Karoui · 2018
Cited alongside, same era.
Andrea Montanari, Feng Ruan, Youngtak Sohn, and Jun Yan · 2019
Closest in time.
Harmless interpolation of noisy data in regression
Vidya Muthukumar, Kailas Vodrahalli, and Anant Sahai · 2019
Closest in time.
More data can hurt for linear regression: Sample-wise double descent
Preetum Nakkiran · 2019
Closest in time.
Deep double descent: Where bigger models and more data hurt
Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, and Ilya Sutskever · 2019
Closest in time.
The impact of regularization on high-dimensional logistic regression
Fariborz Salehi, Ehsan Abbasi, and Babak Hassibi · 2019
Closest in time.
A modern maximum-likelihood theory for high-dimensional logistic regression
Pragya Sur and Emmanuel J Candès · 2019
Closest in time.
A jamming transition from under-to over-parametrization affects generalization in deep learning
S Spigler, M Geiger, S d’Ascoli, L Sagun, G Biroli, and M Wyart · 2019
Closest in time.
Sharp guarantees for solving random equations with one-bit information
Hossein Taheri, Ramtin Pedarsani, and Christos Thrampoulidis · 2019
Closest in time.
Does slope outperform bridge regression?
Shuaiwen Wang, Haolei Weng, and Arian Maleki · 2019
Closest in time.
How many variables should be entered in a principal component regression equation?
Ji Xu and Daniel Hsu · 2019
Closest in time.
A model of double descent for high-dimensional logistic regression
Zeyu Deng, Abla Kammoun, and Christos and Thrampoulidis · 2020
Closest in time.
Precise tradeoffs in adversarial training for linear regression
Adel Javanmard, Mahdi Soltanolkotabi, and Hamed Hassani · 2020
Closest in time.
On the precise error analysis of support vector machines
Abla Kammoun and Mohamed-Slim Alouini · 2020
Closest in time.
Analytic study of double descent in binary classification: The impact of loss
Ganesh Kini and Christos Thrampoulidis · 2020
Closest in time.
Regularization in high-dimensional regression and classification via random matrix theory
Panagiotis Lolas · 2020
Closest in time.
A precise high-dimensional asymptotic theory for boosting and min-l1-norm interpolated classifiers
Tengyuan Liang and Pragya Sur · 2020
Closest in time.
The role of regularization in classification of high-dimensional noisy gaussian mixture
Francesca Mignacco, Florent Krzakala, Yue M Lu, and Lenka Zdeborová · 2020
Closest in time.
Sharp asymptotics and optimal performance for inference in binary models
Hossein Taheri, Ramtin Pedarsani, and Christos Thrampoulidis · 2020
Closest in time.