Fetching the paper…
Reading the bibliography…
We consider linear regression in the high-dimensional regime where the number of observations $n$ is smaller than the number of parameters $p$.
L. Le Cam, “On the asymptotic theory of estimation and testing hypotheses,” in Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability
1956
Earlier work this paper cites.
World Scientific, 1987
M. Mézard, G. Parisi, and M. A. Virasoro, Spin Glass Theory and Beyond · 1987
Earlier work this paper cites.
S. Chen and D. Donoho, “Examples of basis pursuit,” in Proceedings of Wavelet Applications in Signal and Image Processing III
1995
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection with the Lasso,” J. Royal. Statist. Soc B
1996
Earlier work this paper cites.
Cambridge University Press, 2000
A. W. Van der Vaart, Asymptotic statistics · 2000
Earlier work this paper cites.
M. Ledoux, “The concentration of measure phenomenon,” in Mathematical Surveys and Monographs
2001
Earlier work this paper cites.
T. Tanaka, “A Statistical-Mechanics Approach to Large-System Analysis of CDMA Multiuser Detectors,” IEEE Trans. on Inform. Theory
2002
Earlier work this paper cites.
F. Guerra, “Broken replica symmetry bounds in the mean field spin glass model,” Communications in mathematical physics
2003
Earlier work this paper cites.
M. Aizenman, R. Sims, and S. L. Starr, “Extended variational principle for the sherrington-kirkpatrick spin-glass model,” Physical Review B
2003
Earlier work this paper cites.
E. Greenshtein and Y. Ritov, “Persistence in high-dimensional predictor selection and the virtue of over-parametrization,” Bernoulli
2004
Earlier work this paper cites.
D. L. Donoho and J. Tanner, “Neighborliness of randomly-projected simplices in high dimensions,” Proceedings of the National Academy of Sciences
2005
Earlier work this paper cites.
Springer, 2005
E. Lehmann and J. Romano, Testing statistical hypotheses · 2005
Earlier work this paper cites.
D. Guo and S. Verdu, “Randomly Spread CDMA: Asymptotics via Statistical Physics,” IEEE Trans. on Inform. Theory
2005
Earlier work this paper cites.
T. Tanaka and M. Okada, “Approximate belief propagation, density evolution, and statistical neurodynamics for cdma multiuser detection,” Information Theory, IEEE Transactions on
2005
Earlier work this paper cites.
N. Meinshausen and P. Bühlmann, “High-dimensional graphs and variable selection with the lasso,” Ann. Statist
2006
Earlier work this paper cites.
D. L. Donoho, “High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension,” Discrete Comput. Geometry
2006
Earlier work this paper cites.
P. Zhao and B. Yu, “On model selection consistency of Lasso,” The Journal of Machine Learning Research
2006
Earlier work this paper cites.
A. Montanari and D. Tse, “Analysis of belief propagation for non-linear problems: the example of CDMA (or: how to prove Tanaka’s formula),” in Proceedings of IEEE Inform. Theory Workshop
2006
Earlier work this paper cites.
Cambridge: MIT Press, 2006
O. Chapelle, B. Schölkopf, A. Zien, et al · 2006
Earlier work this paper cites.
E. Candés and T. Tao, “The Dantzig selector: statistical estimation when p is much larger than n,” Annals of Statistics
2007
Earlier work this paper cites.
P. J. Bickel and E. Levina, “Regularized estimation of large covariance matrices,” The Annals of Statistics
2008
Earlier work this paper cites.
D. L. Donoho and J. Tanner, “Counting faces of randomly projected polytopes when the projection radically lowers dimension,” Journal of American Mathematical Society
2009
Cited alongside, same era.
P. J. Bickel, Y. Ritov, and A. B. Tsybakov, “Simultaneous analysis of Lasso and Dantzig selector,” Amer. J. of Mathematics
2009
Cited alongside, same era.
G. Raskutti, M. J. Wainwright, and B. Yu, “Minimax rates of estimation for high-dimensional linear regression over ℓ q \ell_{q} -balls,” in 47th Annual Allerton Conf
2009
Cited alongside, same era.
M. Wainwright, “Sharp thresholds for high-dimensional and noisy sparsity recovery using ℓ 1 \ell_{1} -constrained quadratic programming,” IEEE Trans. on Inform. Theory
2009
Cited alongside, same era.
S. van de Geer and P. Bühlmann, “On the conditions used to prove oracle results for the lasso,” Electron. J. Statist
A. T. Campo, A. Guillen i Fabregas, and E. Biglieri, “Large-system analysis of multiuser detection with an unknown number of users: A high-snr approach,” Information Theory, IEEE Transactions on
2011
Later among the works it cites.
A. Tulino, G. Caire, S. Shamai, and S. Verdú, “Support recovery with sparsely sampled free random matrices,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
2011
Later among the works it cites.
T. Cai, W. Liu, and X. Luo, “A constrained ℓ 1 \ell_{1} minimization approach to sparse precision matrix estimation,” Journal of the American Statistical Association
2011
Later among the works it cites.
E. Candès and B. Recht, “Simple bounds for recovering low-complexity models,” Mathematical Programming
2012
Later among the works it cites.
M. Bayati and A. Montanari, “The LASSO risk for gaussian matrices,” IEEE Trans. on Inform. Theory
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
J. Wiley and Sons, 2009
P. Huber and E. Ronchetti, Robust Statistics (second edition) · 2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message Passing Algorithms for Compressed Sensing,” Proceedings of the National Academy of Sciences
2009
Cited alongside, same era.
S. Rangan, A. K. Fletcher, and V. K. Goyal, “Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing,” in NIPS
2009
Cited alongside, same era.
Y. Kabashima, T. Wadayama, and T. Tanaka, “A typical reconstruction limit for compressed sensing based on L p L_{p} -norm minimization,” J.Stat. Mech
2009
Cited alongside, same era.
D. Guo, D. Baron, and S. Shamai, “A Single-letter Characterization of Optimal Noisy Compressed Sensing,” in 47th Annual Allerton Conference
2009
Cited alongside, same era.
Oxford, 2009
M. Mézard and A. Montanari, Information, Physics and Computation · 2009
Cited alongside, same era.
D. L. Donoho and J. Tanner, “Precise undersampling theorems,” Proceedings of the IEEE
2010
Cited alongside, same era.
2012
Later among the works it cites.
E. J. Candès and M. A. Davenport, “How well can we estimate a sparse vector?,” Applied and Computational Harmonic Analysis
2012
Later among the works it cites.
P. Bühlmann, “Statistical significance in high-dimensional linear models.” arXiv:1202.1377
2012
Later among the works it cites.
T. Sun and C.-H. Zhang, “Scaled sparse linear regression,” Biometrika
2012
Later among the works it cites.
2012
Later among the works it cites.
Y. Wu and S. Verdú, “Optimal phase transitions in compressed sensing,” Information Theory, IEEE Transactions on
2012
Later among the works it cites.
Y. Kabashima and S. C. M. Vehkapera, “Typical l 1 l_{1} -recovery limit of sparse vectors represented by concatenations of random orthogonal matrices,” J. Stat. Mech
2012
Later among the works it cites.
2012
Later among the works it cites.
2013
Closest in time.
C.-H. Zhang and S. Zhang, “Confidence Intervals for Low-Dimensional Parameters in High-Dimensional Linear Models,” Journal of the Royal Statistical Society: Series B (Statistical Methodology)
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
A. Javanmard and A. Montanari, “Nearly Optimal Sample Size in Hypothesis Testing for High-Dimensional Regression,” in 52nd Annual Allerton Conference · 2013
Closest in time.
2013
Closest in time.
Springer, 2013
D. Panchenko, The Sherrington-Kirkpatrick model · 2013
Closest in time.
2013
Closest in time.
M. Rudelson and S. Zhou, “Reconstruction from anisotropic random measurements,” Information Theory, IEEE Transactions on
2013
Closest in time.