The Smooth-Lasso and other ℓ1+ℓ2-penalized methods

Mohamed Hebiri; Sara van de Geer

doi:10.1214/11-ejs638

journal article Jan 01, 2011

The Smooth-Lasso and other ℓ1+ℓ2-penalized methods

Mohamed Hebiri Sara van de Geer

Electronic Journal of Statistics Vol. 5 No. none · Institute of Mathematical Statistics

View at Publisher Save 10.1214/11-ejs638

Topics

No keywords indexed for this article. Browse by subject →

References

43

[1]

[5] Bunea, F. (2008). Honest variable selection in linear and logistic regression models via, ℓ1 and ℓ1+ℓ2 penalization. Electron. J. Stat. 2:1153–1194. 10.1214/08-ejs287

[2]

[16] Kim, S. and Koh, K. and Boyd, S. and Gorinevsky, D. (2009)., l1 trend filtering. SIAM Rev. 51(2):339–360. 10.1137/070690274

[3]

[1] Bach, F. (2008). Consistency of the group Lasso and multiple kernel learning., J. Mach. Learn. Res., 9:1179–1225.

[4]

[2] Belloni, A. and Chernozhukov, V. (2010)., Post-ℓ1-Penalized Estimation in High Dimensional Sparse Linear Regression Models. Submitted. 10.1214/10-aos827

[5]

Simultaneous analysis of Lasso and Dantzig selector

Peter J. Bickel, Ya’acov Ritov, Alexandre B. Tsybakov

The Annals of Statistics 10.1214/08-aos620

[6]

[4] Bunea, F. (2008). Consistent selection via the Lasso for high dimensional approximating regression models., IMS Collections, B. Clarke and S. Ghosal Editors, 3:122–138.

[7]

[6] Bunea, F. and Tsybakov, A. and Wegkamp, M. (2007). Aggregation for Gaussian regression., Ann. Statist., 35(4):1674–1697. 10.1214/009053606000001587

[8]

[7] Bunea, F. and Tsybakov, A. and Wegkamp, M. (2007). Sparsity oracle inequalities for the Lasso., Electron. J. Stat., 1:169–194. 10.1214/07-ejs008

[9]

[8] Chesneau, C. and Hebiri, M. (2008). Some theoretical results on the grouped variables Lasso., Math. Methods Statist., 17(4):317–326. 10.3103/s1066530708040030

[10]

[9] Dalalyan, A. and Tsybakov, A. (2007). Aggregation by exponential weighting and sharp oracle inequalities. In, Learning theory, volume 4539 of Lecture Notes in Comput. Sci., pages 97–111. Springer, Berlin. 10.1007/978-3-540-72927-3_9

[11]

[10] Daye, Z. John and Jeng, X. Jessie (2009). Shrinkage and model selection with correlated variables via weighted fusion., Computational Statistics & Data Analysis, 53(4):1284–1298. 10.1016/j.csda.2008.11.007

[12]

[11] Dümbgen, L. and van de Geer, S. and Veraar, M. and Wellner, J. (2010). Nemirovski’s inequalities revisited., Amer. Math. Monthly, 117(2):138–160.

[13]

Least angle regression

Bradley Efron, Trevor Hastie, Iain Johnstone et al.

The Annals of Statistics 10.1214/009053604000000067

[14]

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

Jianqing Fan, Runze Li

Journal of the American Statistical Association 10.1198/016214501753382273

[15]

[14] Hebiri, M. (2008). Regularization with the Smooth-Lasso procedure. Preprint Laboratoire de Probabilités et Modèles, Aléatoires.

[16]

[15] Jia, J. and Yu, B. (2008). On model selection consistency of elastic net when, p≫n. Tech. Report 756, Statistics, UC Berkeley.

[17]

[17] Land, S. and Friedman, J. (1996). Variable fusion: a new method of adaptive signal regression., Manuscript.

[18]

[18] Lounici, K. (2008). Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators., Electron. J. Stat., 2:90–102. 10.1214/08-ejs177

[19]

[19] Meier, L. and van de Geer, S. and Bühlmann, P. (2008). The group Lasso for logistic regression., J. R. Stat. Soc. Ser. B Stat. Methodol., 70(1):53–71. 10.1111/j.1467-9868.2007.00627.x

[20]

[20] Meinshausen, N. (2007). Relaxed Lasso Titre., Comput. Statist. Data Anal., 52(1):374–393. 10.1016/j.csda.2006.12.019

[21]

High-dimensional graphs and variable selection with the Lasso

Nicolai Meinshausen, Peter Bühlmann

The Annals of Statistics 10.1214/009053606000000281

[22]

[22] Meinshausen, N. and Meier, L. and Bühlmann, P. (2009). p-values for high-dimensional regression., J. Amer. Statist. Assoc., 104:1671-1681. 10.1198/jasa.2009.tm08647

[23]

[23] Meinshausen, N. and Yu, B. (2009). Lasso-type recovery of sparse representations for high-dimensional data., Ann. Statist., 37(1):246–270. 10.1214/07-aos582

[24]

[24] Nesterov, Yu. (2007). Gradient methods for minimizing composite objective function. CORE Discussion Papers 2007076, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE). Sep, 2007.

[25]

[25] Raskutti, G. and Wainwright, M. and Yu, B. (2009). Minimax rates of estimation for high-dimensional linear regression over, ℓq-balls. Submitted. 10.1109/tit.2011.2165799

[26]

[26] Rigollet, P. and Tsybakov, A. (2010). Exponential Screening and optimal rates of sparse estimation., Submitted. 10.1214/10-aos854

[27]

[27] Rinaldo, A. (2009). Properties and refinements of the fused lasso., Ann. Statist., 37(5B):2922–2952. 10.1214/08-aos665

[28]

[28] Rosset, S. and Zhu, J. (2007). Piecewise linear regularized solution paths., Ann. Statist., 35(3):1012–1030. 10.1214/009053606000001370

[29]

Regression Shrinkage and Selection Via the Lasso

Robert Tibshirani

Journal of the Royal Statistical Society Series B:... 10.1111/j.2517-6161.1996.tb02080.x

[30]

[30] Tibshirani, R. and Saunders, M. and Rosset, S. and Zhu, J. and Knight, K. (2005). Sparsity and smoothness via the fused lasso., J. R. Stat. Soc. Ser. B Stat. Methodol., 67(1):91–108. 10.1111/j.1467-9868.2005.00490.x

[31]

[31] Tibshirani, R.J. and Taylor, J. (2010). Regularization Paths for Least Squares Problems with Generalized, ℓ1 Penalties. Submitted.

[32]

[32] Tsybakov, A. and van de Geer, S. (2005). Square root penalty: adaptation to the margin in classification and in edge estimation., Ann. Statist., 33(3):1203–1224. 10.1214/009053604000001066

[33]

[33] van de Geer, S. and Bühlmann, P. (2009). On the conditions used to prove oracle results for the Lasso., Elect. Journ. Statist., 3:1360–1392. 10.1214/09-ejs506

[34]

[34] Wainwright, M. (2006). Sharp thresholds for noisy and high-dimensional recovery of sparsity using, ℓ1-constrained quadratic programming. Manuscript.

[35]

[35] Ye, F. and Zhang, C. (2010). Rate Minimaxity of the Lasso and Dantzig Selector for the, ℓq Loss in ℓr Balls J. Mach. Learn. Res., 11:3519–3540.

[36]

Model Selection and Estimation in Regression with Grouped Variables

Ming Yuan, Yi Lin

Journal of the Royal Statistical Society Series B:... 10.1111/j.1467-9868.2005.00532.x

[37]

[37] Yuan, M. and Lin, Y. (2007). On the non-negative garrote estimator., J. R. Stat. Soc. Ser. B Stat. Methodol., 69(2):143–161. 10.1111/j.1467-9868.2007.00581.x

[38]

[38] Yueh, W-C. (2005). Eigenvalues of several tridiagonal matrices., Appl. Math. E-Notes, 2:66–74 (electronic).

[39]

[39] Zhang, C-H. and Huang, J. (2008). The sparsity and bias of the LASSO selection in high-dimensional linear regression., Ann. Statist., 36(4):1567–1594. 10.1214/07-aos520

[40]

[40] Zhao, P. and Yu, B. (2006). On model selection consistency of Lasso., J. Mach. Learn. Res., 7:2541–2563.

[41]

[41] Zou, H. (2006). The adaptive lasso and its oracle properties., J. Amer. Statist. Assoc., 101(476):1418–1429. 10.1198/016214506000000735

[42]

Regularization and Variable Selection Via the Elastic Net

Hui Zou, Trevor Hastie

Journal of the Royal Statistical Society Series B:... 10.1111/j.1467-9868.2005.00503.x

[43]

[43] Zou, H. and Zhang, H. (2009). On the adaptive elastic-net with a diverging number of parameters., Ann. Statist., 37(4):1733–1751. 10.1214/08-aos625

Metrics

75

Citations

43

References

Details

Published: Jan 01, 2011
Vol/Issue: 5(none)

Authors

Cite This Article

Mohamed Hebiri, Sara van de Geer (2011). The Smooth-Lasso and other ℓ1+ℓ2-penalized methods. Electronic Journal of Statistics, 5(none). https://doi.org/10.1214/11-ejs638

The Smooth-Lasso and other ℓ1+ℓ2-penalized methods

You May Also Like