Fetching the paper…
Reading the bibliography…
Convex estimators such as the Lasso, the matrix Lasso and the group Lasso have been studied extensively in the last two decades, demonstrating great success in both theory and practice.
[author] Bellec, Pierre C.P. C. and Zhang, Cun-HuiC.-H. (2021). Second-order Stein: SURE for SURE and other applications in high-dimensional inference. Ann. Statist. 49 1864-1903. \endbibitem
1903
Earlier work this paper cites.
[author] Gordon, YehoramY. (1988). On Milman’s inequality and random subspaces which escape through a mesh in Rn. In Geometric Aspects of Functional Analysis 84–106. Springer. \endbibitem
1988
Earlier work this paper cites.
[author] Johnstone, Iain MI. M. (1994). On minimax estimation of a sparse normal mean vector. The Annals of Statistics 271–289. \endbibitem
1994
Earlier work this paper cites.
[author] Donoho, David LD. L. and Johnstone, Iain MI. M. (1995). Adapting to unknown smoothness via wavelet shrinkage. Journal of the american statistical association 90 1200–1224. \endbibitem
1995
Earlier work this paper cites.
[author] Tibshirani, RobertR. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological) 267–288. \endbibitem
1996
Earlier work this paper cites.
[author] Knight, KeithK. and Fu, WenjiangW. (2000). Asymptotics for lasso-type estimators. Annals of statistics 1356–1378. \endbibitem
2000
Earlier work this paper cites.
[author] Birgé, LucienL. and Massart, PascalP. (2001). Gaussian model selection. Journal of the European Mathematical Society 3 203–268. \endbibitem
2001
Earlier work this paper cites.
[author] Boucheron, StéphaneS., Lugosi, GáborG. and Bousquet, OlivierO. (2004). Concentration inequalities. In Advanced Lectures on Machine Learning 208–240. Springer. \endbibitem
2004
Earlier work this paper cites.
[author] Candes, Emmanuel JE. J. and Tao, TerenceT. (2005). Decoding by linear programming. IEEE transactions on information theory 51 4203–4215. \endbibitem
2005
Earlier work this paper cites.
[author] Birgé, LucienL. and Massart, PascalP. (2007). Minimal penalties for Gaussian model selection. Probab. Theory Related Fields 138 33–73. 2288064 \endbibitem
2007
Earlier work this paper cites.
[author] Candes, EmmanuelE. and Tao, TerenceT. (2007). The Dantzig selector: statistical estimation when p is much larger than n. The Annals of Statistics 2313–2351. \endbibitem
2007
Earlier work this paper cites.
[author] Mendelson, ShaharS., Pajor, AlainA. and Tomczak-Jaegermann, NicoleN. (2007). Reconstruction and subgaussian operators in asymptotic geometric analysis. Geometric and Functional Analysis 17 1248–1282. \endbibitem
2007
Earlier work this paper cites.
[author] Candes, Emmanuel JE. J. (2008). The restricted isometry property and its implications for compressed sensing. Comptes rendus mathematique 346 589–592. \endbibitem
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
[author] Zhang, Cun-HuiC.-H. and Huang, JianJ. (2008). The sparsity and bias of the Lasso selection in high-dimensional linear regression. Ann. Statist. 36 1567–1594. \endbibitem
2008
Earlier work this paper cites.
[author] Bickel, Peter J.P. J., Ritov, Ya’acovY. and Tsybakov, Alexandre B.A. B. (2009). Simultaneous analysis of Lasso and Dantzig selector. Ann. Statist. 37 1705–1732. \endbibitem
2009
Earlier work this paper cites.
[author] Candès, Emmanuel J.E. J. and Plan, YanivY. (2009). Near-ideal model selection by L1 minimization. Ann. Statist. 37 2145–2177. \endbibitem
2009
Earlier work this paper cites.
[author] Zhang, Cun-HuiC.-H. (2010). Nearly unbiased variable selection under minimax concave penalty. The Annals of statistics 894–942. \endbibitem
2010
Cited alongside, same era.
[author] Bühlmann, PeterP. and Van De Geer, SaraS. (2011). Statistics for high-dimensional data: methods, theory and applications. Springer. \endbibitem
2011
Cited alongside, same era.
[author] Candes, Emmanuel JE. J. and Plan, YanivY. (2011). Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Transactions on Information Theory 57 2342–2359. \endbibitem
2011
Cited alongside, same era.
[author] Koltchinskii, VladimirV., Lounici, KarimK. and Tsybakov, Alexandre B.A. B. (2011). Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Statist. 39 2302–2329. \endbibitem
2011
Cited alongside, same era.
[author] Giraud, ChristopheC. (2014). Introduction to high-dimensional statistics 138. CRC Press. \endbibitem
2014
Later among the works it cites.
[author] Lecué, GuillaumeG. and Mendelson, ShaharS. (2014). Sparse recovery under weak moment assumptions. To appear in Journal of the European Mathematical Society. \endbibitem
2014
Later among the works it cites.
[author] Dirksen, SjoerdS. (2015). Tail bounds via generic chaining. Electronic Journal of Probability 20. \endbibitem
2015
Later among the works it cites.
[author] Su, WeijieW. and Candes, EmmanuelE. (2016). SLOPE is adaptive to unknown sparsity and asymptotically minimax. The Annals of Statistics 44 1038–1068. \endbibitem
2016
Later among the works it cites.
{binproceedings}
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
[author] Lounici, KarimK., Pontil, MassimilianoM., van de Geer, SaraS. and Tsybakov, Alexandre B.A. B. (2011). Oracle inequalities and optimal inference under group sparsity. Ann. Statist. 39 2164–2204. \endbibitem
2011
Cited alongside, same era.
[author] Rigollet, PhilippeP. and Tsybakov, AlexandreA. (2011). Exponential screening and optimal rates of sparse estimation. The Annals of Statistics 39 731–771. \endbibitem
2011
Cited alongside, same era.
[author] Rohde, AngelikaA. and Tsybakov, Alexandre BA. B. (2011). Estimation of high-dimensional low-rank matrices. The Annals of Statistics 39 887–930. \endbibitem
2011
Cited alongside, same era.
[author] Chandrasekaran, VenkatV., Recht, BenjaminB., Parrilo, Pablo AP. A. and Willsky, Alan SA. S. (2012). The convex geometry of linear inverse problems. Foundations of Computational mathematics 12 805–849. \endbibitem
2012
Cited alongside, same era.
[author] Negahban, Sahand NS. N., Ravikumar, PradeepP., Wainwright, Martin JM. J. and Yu, BinB. (2012). A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers. Statistical Science 538–557. \endbibitem
2012
Cited alongside, same era.
[author] Sun, TingniT. and Zhang, Cun-HuiC.-H. (2012). Scaled sparse linear regression. Biometrika 99 879–898. \endbibitem
2012
Cited alongside, same era.
[author] Verzelen, NicolasN. (2012). Minimax risks for sparse regressions: Ultra-high dimensional phenomenons. Electronic Journal of Statistics 6 38–90. \endbibitem
2012
Cited alongside, same era.
[author] Belloni, AlexandreA. and Chernozhukov, VictorV. (2013). Least squares after model selection in high-dimensional sparse models. Bernoulli 19 521–547. \endbibitem
2013
Cited alongside, same era.
[author] Bellec, Pierre CP. C. and Tsybakov, Alexandre BA. B. (2017). Bounds on the prediction error of penalized least squares estimators with convex penalty. In Modern Problems of Stochastic Analysis and Statistics, Selected Contributions In Honor of Valentin Konakov Springer. \endbibitem
2017
Later among the works it cites.
[author] Dalalyan, Arnak SA. S., Hebiri, MohamedM. and Lederer, JohannesJ. (2017). On the prediction performance of the Lasso. Bernoulli 23 552–581. \endbibitem
2017
Later among the works it cites.
[author] Liaw, ChristopherC., Mehrabian, AbbasA., Plan, YanivY. and Vershynin, RomanR. (2017). A simple tool for bounding the deviation of random matrices on geometric sets. In Geometric aspects of functional analysis 277–299. Springer. \endbibitem
2017
Later among the works it cites.
[author] Zhang, YuchenY., Wainwright, Martin JM. J. and Jordan, Michael IM. I. (2017). Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators. Electronic Journal of Statistics 11 752–799. \endbibitem
2017
Later among the works it cites.
[author] Bellec, Pierre C.P. C., Dalalyan, Arnak S.A. S., Grappin, EdwinE. and Paris, QuentinQ. (2018). On the prediction loss of the lasso in the partially labeled setting. Electron. J. Statist. 12 3443-3472. \endbibitem
2018
Closest in time.
[author] Bellec, Pierre C.P. C., Lecué, GuillaumeG. and Tsybakov, Alexandre B.A. B. (2018). Slope meets Lasso: Improved oracle bounds and optimality. Ann. Statist. 46 3603-3642. \endbibitem
2018
Closest in time.
[author] Lecué, GuillaumeG. and Mendelson, ShaharS. (2018). Regularization and the small-ball method I: Sparse recovery. Ann. Statist. 46 611–641. \endbibitem
2018
Closest in time.
2018
Closest in time.
{binproceedings}
2019
Closest in time.
[author] Feng, LongL. and Zhang, Cun-HuiC.-H. (2019). Sorted concave penalized regression. Annals of Statistics 47 3069–3098. \endbibitem
2019
Closest in time.