Fetching the paper…
Reading the bibliography…
A recently proposed SLOPE estimator (arXiv:1407.3824) has been shown to adaptively achieve the minimax $\ell_2$ estimation rate under high-dimensional sparse linear regression models (arXiv:1503.08393).
Asymptotic approximations of integrals
Roderick Wong · 2001
Earlier work this paper cites.
Near optimal signal recovery from random projections: Universal encoding strategies?
Emmanuel Candes and Terence Tao · 2004
Earlier work this paper cites.
Neighborliness of randomly projected simplices in high dimensions
David L Donoho and Jared Tanner · 2005
Earlier work this paper cites.
Sparse nonnegative solution of underdetermined linear equations by linear programming
David L Donoho and Jared Tanner · 2005
Earlier work this paper cites.
For most large underdetermined systems of linear equations the minimal ℓ 1 \ell_{1} -norm solution is also the sparsest solution
David L Donoho · 2006
Earlier work this paper cites.
High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
David L Donoho · 2006
Earlier work this paper cites.
Convex optimization theory
Dimitri P Bertsekas · 2009
Earlier work this paper cites.
Simultaneous analysis of lasso and dantzig selector
Peter J Bickel, Ya’acov Ritov, Alexandre B Tsybakov, et al · 2009
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
David L Donoho, Arian Maleki, and Andrea Montanari · 2009
Earlier work this paper cites.
Various thresholds for ℓ 1 \ell_{1} -optimization in compressed sensing
Mihailo Stojnic · 2009
Earlier work this paper cites.
Rényi information dimension: Fundamental limits of almost lossless analog compression
Yihong Wu and Sergio Verdú · 2010
Earlier work this paper cites.
Rate minimaxity of the lasso and dantzig selector for the ℓ q \ell_{q} loss in ℓ r \ell_{r} balls
Fei Ye and Cun-Hui Zhang · 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.
The lasso risk for gaussian matrices
Mohsen Bayati and Andrea Montanari · 2011
Cited alongside, same era.
The noise-sensitivity phase transition in compressed sensing
David L Donoho, Arian Maleki, and Andrea Montanari · 2011
Cited alongside, same era.
Minimax rates of estimation for high-dimensional linear regression over ℓ q \ell_{q} -balls
Garvesh Raskutti, Martin J Wainwright, and Bin Yu · 2011
Cited alongside, same era.
A unified framework for high-dimensional analysis of m m -estimators with decomposable regularizers
Sahand N Negahban, Pradeep Ravikumar, Martin J Wainwright, Bin Yu, et al · 2012
Cited alongside, same era.
Minimax risks for sparse regressions: Ultra-high dimensional phenomenons
Nicolas Verzelen et al · 2012
Cited alongside, same era.
Regularization and the small-ball method i: sparse recovery
Guillaume Lecué, Shahar Mendelson, et al · 2018
Later among the works it cites.
Asymptotics for high dimensional regression m-estimates: fixed design results
Lihua Lei, Peter J Bickel, and Noureddine El Karoui · 2018
Later among the works it cites.
Consistent parameter estimation for lasso and approximate message passing
Ali Mousavi, Arian Maleki, Richard G Baraniuk, et al · 2018
Later among the works it cites.
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, 2018
Roman Vershynin · 2018
Later among the works it cites.
Approximate leave-one-out for fast parameter tuning in high dimensions
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mihailo Stojnic · 2013
Cited alongside, same era.
Slope - adaptive variable selection via convex optimization
Malgorzata Bogdan, Ewout Van Den Berg, Chiara Sabatti, Weijie Su, and Emmanuel J Candès · 2015
Cited alongside, same era.
Regularized linear regression: A precise analysis of the estimation error
Christos Thrampoulidis, Samet Oymak, and Babak Hassibi · 2015
Cited alongside, same era.
Slope is adaptive to unknown sparsity and asymptotically minimax
Weijie Su, Emmanuel Candes, et al · 2016
Cited alongside, same era.
Phase retrieval via linear programming: Fundamental limits and algorithmic improvements
Oussama Dhifallah, Christos Thrampoulidis, and Yue M Lu · 2017
Cited alongside, same era.
The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled chi-square
Pragya Sur, Yuxin Chen, and Emmanuel J Candès · 2017
Cited alongside, same era.
Does ℓ p \ell_{p} -minimization outperform ℓ 1 \ell_{1} -minimization?
Le Zheng, Arian Maleki, Haolei Weng, Xiaodong Wang, and Teng Long · 2017
Cited alongside, same era.
Shuaiwen Wang, Wenda Zhou, Haihao Lu, Arian Maleki, and Vahab Mirrokni · 2018
Later among the works it cites.
Approximate leave-one-out for high-dimensional non-differentiable learning problems
Shuaiwen Wang, Wenda Zhou, Arian Maleki, Haihao Lu, and Vahab Mirrokni · 2018
Later among the works it cites.
Overcoming the limitations of phase transition by higher order analysis of regularization techniques
Haolei Weng, Arian Maleki, Le Zheng, et al · 2018
Later among the works it cites.
Algorithmic analysis and statistical estimation of slope via approximate message passing
Zhiqi Bu, Jason Klusowski, Cynthia Rush, and Weijie Su · 2019
Closest in time.
Michael Celentano · 2019
Closest in time.
Asymptotics and optimal designs of slope for sparse linear regression
Hong Hu and Yue M Lu · 2019
Closest in time.
Low noise sensitivity analysis of ℓ q \ell_{q} -minimization in oversampled systems
Haolei Weng and Arian Maleki · 2019
Closest in time.
Which bridge estimator is optimal for variable selection?
Shuaiwen Wang, Haolei Weng, and Arian Maleki · 2020
Closest in time.