Fetching the paper…
Reading the bibliography…
In high-dimensional regression, we attempt to estimate a parameter vector $\beta_0\in\mathbb{R}^p$ from $n\lesssim p$ observations $\{(y_i,x_i)\}_{i\leq n}$ where $x_i\in\mathbb{R}^p$ is a vector of predictors and $y_i$ is a response variable.
Proximité et Dualité dans un Espace Hilbertien
Jean-Jacques Moreau · 1965
Earlier work this paper cites.
Geometric Topology in Dimensions 2 and 3
Edwin E. Moise · 1977
Earlier work this paper cites.
Some asymptotic theory for the bootstrap
Peter J. Bickel and David A. Freedman · 1981
Earlier work this paper cites.
Estimation of the mean of a multivariate normal distribution
Charles M. Stein · 1981
Earlier work this paper cites.
A class of wasserstein metrics for probability distributions
Clark R. Givens and Rae Michael Shortt · 1984
Earlier work this paper cites.
Handbook of Stochastic Methods for Physics, Chemistry and the Natural Science
C.W. Gardiner · 1985
Earlier work this paper cites.
Fundamentals of Statistical Exponential Families with Applications to Statistical Decision Theory
Lawrence D. Brown · 1986
Earlier work this paper cites.
Examples of basis pursuit
S.S. Chen and David Donoho · 1995
Earlier work this paper cites.
Regression shrinkage and selection with the Lasso
Rob Tibshirani · 1996
Earlier work this paper cites.
Convex Analysis
R. Tyrrell Rockafellar · 1997
Earlier work this paper cites.
Concentration of measure and logarithmic Sobolev inequalities
Michel Ledoux · 1999
Earlier work this paper cites.
Decoding by linear programming
Emmanuel Candés and Terence Tao · 2005
Earlier work this paper cites.
Testing Statistical Hypotheses
Erich L. Lehmann and Joseph P. Romano · 2005
Earlier work this paper cites.
The Dantzig selector: statistical estimation when p is much larger than n
Emmanuel Candés and Terence Tao · 2007
Earlier work this paper cites.
A simple proof of the Poincaré inequality for a large class of probability measures including the log-concave case
Dominique Bakry, Franck Barth, and Patrick Cattiaux · 2008
Earlier work this paper cites.
Simultaneous regression shrinkage, variable selection, and supervised clustering of predictors with OSCAR
Howard D. Bondell and Brian J. Reich · 2008
Earlier work this paper cites.
Simultaneous analysis of Lasso and Dantzig selector
Petet J. Bickel, Yacov Ritov, and Alexander B. Tsybakov · 2009
Earlier work this paper cites.
Message passing algorithms for compressed sensing
David Donoho, Arian Maleki, and Andrea Montanari · 2009
Earlier work this paper cites.
Information, Physics, and Computation
M. Mézard and A. Montanari · 2009
Earlier work this paper cites.
On the conditions used to prove oracle results for the Lasso
Sara A. van de Geer and Peter Bühlmann · 2009
Earlier work this paper cites.
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
Martin J. Wainwright · 2009
Earlier work this paper cites.
An Introduction to Random Matrices
Greg W. Anderson, Alice Guionnet, and Ofer Zeitouni · 2010
Earlier work this paper cites.
Lower bounds for sparse recovery
Khanh Do Ba, Piotr Indyk, Eric Price, and David P. Woodruff · 2010
Earlier work this paper cites.
Message passing algorithms for compressed sensing: I. motivation and construction
David Donoho, Arian Maleki, and Andrea Montanari · 2010
Earlier work this paper cites.
Probability: Theory and Examples
Rick Durrett · 2010
Earlier work this paper cites.
Recovery thresholds for ℓ 1 \ell_{1} optimization in binary compressed sensing
Mihailo Stojnic · 2010
Earlier work this paper cites.
The dynamics of message passing on dense graphs, with applications to compressed sensing
Mohsen Bayati and Andrea Montanari · 2011
Earlier work this paper cites.
Estimation in Gaussian noise: Properties of the minimum mean-square error
Dongning Guo, Yihong Wu, Shlomo Shamai, and Sergio Verdú · 2011
Cited alongside, same era.
Tweedie’s formula and selection bias
Bradley Efron · 2011
Cited alongside, same era.
Applications of the Lindeberg principle in communications and statistical learning
Satish Babu Korada and Andrea Montanari · 2011
Cited alongside, same era.
Generalized approximate message passing for estimation with random linear mixing
Sundeep Rangan · 2011
Cited alongside, same era.
Probability and Measure
Patrick Billingsley · 2012
Cited alongside, same era.
The LASSO risk for gaussian matrices
Mohsen Bayati and Andrea Montanari · 2012
Cited alongside, same era.
The mutual information in random linear estimation
Jean Barbier, Mohamad Dia, Nicolas Macris, and Florent Krzakala · 2016
Later among the works it cites.
Concentration Inequalities: A Nonasymptotic Theory of Independence
Stèphane Boucheron, Gàbor Lugosi, and Pascal Massart · 2016
Later among the works it cites.
High dimensional robust M-estimation: asymptotic variance via approximate message passing
David Donoho and Andrea Montanari · 2016
Later among the works it cites.
The replica-symmetric prediction for compressed sensing with gaussian matrices is exact
Galen Reeves and Henry D. Pfister · 2016
Later among the works it cites.
SLOPE is adaptive to unknown sparsity and asymptotically minimax
Weijie Su and Emmanuel Candès · 2016
Later among the works it cites.
Mutual information and optimality of approximate message-passing in random linear estimation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The convex geometry of linear inverse problems
Venkat Chandrasekaran, Benjamin Recht, Pablo A. Parrilo, and Alan S. Willsky · 2012
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2012
Cited alongside, same era.
Optimal M-estimation in high-dimensional regression
Derek Bean, Peter J. Bickel, Noureddine El Karoui, and Bin Yu · 2013
Cited alongside, same era.
Noureddine El Karoui · 2013
Cited alongside, same era.
On robust regression with high-dimensional predictors
Noureddine El Karoui, Derek Bean, Peter J. Bickel, Chinghway Lim, and Bin Yu · 2013
Cited alongside, same era.
State evolution for general approximate message passing algorithms, with applications to spatial coupling
Adel Javanmard and Andrea Montanari · 2013
Cited alongside, same era.
Jean Barbier, Nicolas Macris, Mohamad Dia, and Florent Krzakala · 2017
Later among the works it cites.
High dimensional regression with binary coefficients. Estimating squared error and a phase transtition
Gamarnik David and Zadik Ilias · 2017
Later among the works it cites.
Sparse high-dimensional linear regression. Algorithmic barriers and a local search algorithm
David Gamarnik and Ilias Zadik · 2017
Later among the works it cites.
Vector approximate message passing
Sundeep Rangan, Philip Schniter, and Alyson K. Fletcher · 2017
Later among the works it cites.
Slope meets Lasso: Improved oracle bounds and optimality
Pierre C. Bellec, Guillaume Lecué, and Alexandre B. Tsybakov · 2018
Later among the works it cites.
Notes on computational-to-statistical gaps: predictions using statistical physics
Afonso S. Bandeira, Amelia Perry, and Alexander S. Wein · 2018
Later among the works it cites.
On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
Noureddine El Karoui · 2018
Later among the works it cites.
The distribution of the Lasso: Uniform control over sparse balls and adaptive parameter tuning
Léo Miolane and Andrea Montanari · 2018
Later among the works it cites.
Universality laws for randomized dimension reduction, with applications
Samet Oymak and Joel A Tropp · 2018
Later among the works it cites.
Precise error analysis of regularized M-estimators in high dimensions
Christos Thrampoulidis, Ehsan Abbasi, and Babak Hassibi · 2018
Later among the works it cites.
Optimal errors and phase transitions in high-dimensional generalized linear models
Jean Barbier, Florent Krzakala, Nicolas Macris, Léo Miolane, and Lenka Zdeborová · 2019
Closest in time.
State evolution for approximate message passing with non-separable functions
Raphaël Berthier, Andrea Montanari, and Phan-Minh Nguyen · 2019
Closest in time.
Fundamental limits of symmetric low-rank matrix estimation
Marc Lelarge and Léo Miolane · 2019
Closest in time.
Optimization-based AMP for phase retrieval: The impact of initialization and ℓ 2 \ell_{2} regularization
Junjie Ma, Ji Xu, and Arian Maleki · 2019
Closest in time.
A modern maximum-likelihood theory for high-dimensional logistic regression
Pragya Sur and Emmanuel Candès · 2019
Closest in time.
The role of regularization in classification of high-dimensional noisy Gaussian mixture
Francesca Mignacco, Florent Krzakala, Yue Lu, Pierfrancesco Urbani, 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.
Algorithmic analysis and statistical estimation of slope via approximate message passing
Zhiqi Bu, Jason M. Klusowski, Cynthia Rush, and Weijie J. Su · 2021
Closest in time.
Local statistics, semidefinite programming, and community detection
Jess Banks, Sidhanth Mohanty, and Prasad Raghavendra · 2021
Closest in time.
Approximate separability of symmetrically penalized least squares in high dimensions: characterization and consequences
Michael Celentano · 2021
Closest in time.
Supplement to “Fundamental barriers to high-dimensional regression with convex penalties.”
Michael Celentano and Andrea Montanari · 2021
Closest in time.
Fundamental limits of ridge-regularized empirical risk minimization in high dimensions
Hossein Taheri, Ramtin Pedarsani, and Christos Thrampoulidis · 2021
Closest in time.