Fetching the paper…
Reading the bibliography…
We show that two polynomial time methods, a Lasso estimator with adaptively chosen tuning parameter and a Slope estimator, adaptively achieve the exact minimax prediction and $\ell_2$ estimation rate $(s/n)\log (p/s)$ in high-dimensional linear regression on the class of $s$-sparse target vectors in $\mathbb R^p$.
Handbook of mathematical functions with formulas, graphs, and mathematical tables
M. Abramowitz and I. A. Stegun · 1964
Earlier work this paper cites.
Probability in Banach spaces
M. Ledoux and M. Talagrand · 1991
Earlier work this paper cites.
Near-optimal signal recovery from random projections: universal encoding strategies?
E. J. Candes and T. Tao · 2006
Earlier work this paper cites.
Simultaneous analysis of Lasso and Dantzig selector
P. J. Bickel, Y. Ritov, and A. B. Tsybakov · 2009
Earlier work this paper cites.
Introduction to nonparametric estimation
A.B. Tsybakov · 2009
Earlier work this paper cites.
MAP model selection in gaussian regression
F. Abramovich and V. Grinshtein · 2010
Earlier work this paper cites.
Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems
V. Koltchinskii · 2011
Earlier work this paper cites.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V. Koltchinskii, K. Lounici, and A. B. Tsybakov · 2011
Earlier work this paper cites.
Oracle inequalities and optimal inference under group sparsity
K. Lounici, M. Pontil, A.B. Tsybakov, and Sara A. van de Geer · 2011
Earlier work this paper cites.
Minimax rates of estimation for high-dimensional linear regression over
G. Raskutti, M. Wainwright, and B. Yu · 2011
Cited alongside, same era.
Exponential screening and optimal rates of sparse estimation
P. Rigollet and A. B. Tsybakov · 2011
Cited alongside, same era.
Minimax risks for sparse regressions: Ultra-high dimensional phenomenons
N. Verzelen · 2012
Cited alongside, same era.
Optimal detection of sparse principal components in high dimension
Q. Berthet and P. Rigollet · 2013
Cited alongside, same era.
Concentration inequalities: A nonasymptotic theory of independence
S. Boucheron, G. Lugosi, and P. Massart · 2013
Cited alongside, same era.
How well can we estimate a sparse vector?
E. J. Candes and M.A. Davenport · 2013
Cited alongside, same era.
Upper bounds on product and multiplier empirical processes
S. Mendelson · 2014
Later among the works it cites.
SLOPE—adaptive variable selection via convex optimization
M. Bogdan, E. van den Berg, C. Sabatti, W. Su, and E. J. Candès · 2015
Later among the works it cites.
Tail bounds via generic chaining
S. Dirksen · 2015
Later among the works it cites.
Introduction to high-dimensional statistics
C. Giraud · 2015
Later among the works it cites.
Bounding the Smallest Singular Value of a Random Matrix Without Concentration
V. Koltchinskii and S Mendelson · 2015
Later among the works it cites.
Regularization and the small-ball method i: Sparse recovery
G. Lecué and S. Mendelson · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Concentration via chaining method and its applications
B. Witold · 2013
Cited alongside, same era.
Sparse recovery under weak moment assumptions
G. Lecué and S. Mendelson · 2014
Cited alongside, same era.
Learning without concentration
S. Mendelson · 2014
Cited alongside, same era.
Rate minimaxity of the Lasso and Dantzig selector for the
F. Ye and C.-H. Zhang
Cited in the paper.
Learning without concentration
S. Mendelson · 2015
Later among the works it cites.
SLOPE is adaptive to unknown sparsity and asymptotically minimax
W. Su and E. J. Candès · 2016
Closest in time.
On the prediction performance of the lasso
Arnak S Dalalyan, Mohamed Hebiri, Johannes Lederer, et al · 2017
Closest in time.