Discussion: A tale of three cousins: Lasso, L2Boosting and Dantzig
N. Meinshausen, G. Rocha, and B. Yu
Source: Ann. Statist. Volume 35, Number 6
(2007), 2373-2384.
First Page:
Show
Hide
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.aos/1201012963
Digital Object Identifier: doi:10.1214/009053607000000460
Mathematical Reviews number (MathSciNet): MR2382649
References
Bertsekas, D. (1995). Nonlinear Programming. Athena Scientific, Belmont, MA.
Zentralblatt MATH: 0935.90037
Bühlmann, P. (2006). Boosting for high-dimensional linear models. Ann. Statist. 34 559--583.
Mathematical Reviews (MathSciNet): MR2281878
Digital Object Identifier: doi:10.1214/009053606000000092
Project Euclid: euclid.aos/1151418234
Zentralblatt MATH: 1095.62077
Bunea, F., Tsybakov, A. and Wegkamp, M. (2006). Sparsity oracle inequalities for the lasso. Technical report.
Mathematical Reviews (MathSciNet): MR2312149
Digital Object Identifier: doi:10.1214/07-EJS008
Project Euclid: euclid.ejs/1179759718
Zentralblatt MATH: 1146.62028
Candès, E. (2007). $l_1$-magic. Available at www.l1-magic.org. %Dantzig selector code. Available at http://www.acm.caltech.edu/%7Eemmanuel/software.html.
Chen, S., Donoho, D. and Saunders, M. (1998). Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20 33--61.
Mathematical Reviews (MathSciNet): MR1639094
Digital Object Identifier: doi:10.1137/S1064827596304010
Zentralblatt MATH: 0919.94002
Donoho, D. L. (2006). For most large underdetermined systems of equations the minimal $\ell_1$-norm near-solution approximates the sparsest near-solution. Comm. Pure Appl. Math. 59 907--934.
Mathematical Reviews (MathSciNet): MR2222440
Digital Object Identifier: doi:10.1002/cpa.20131
Donoho, D. L., Elad, M. and Temlyakov, V. N. (2006). Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52 6--18.
Mathematical Reviews (MathSciNet): MR2237332
Digital Object Identifier: doi:10.1109/TIT.2005.860430
Efron, B., Hastie, T., Johnstone, I. and Tibshirani, R. (2004). Least angle regression (with discussion). Ann. Statist. 32 407--499.
Mathematical Reviews (MathSciNet): MR2060166
Digital Object Identifier: doi:10.1214/009053604000000067
Project Euclid: euclid.aos/1083178935
Zentralblatt MATH: 1091.62054
Greenshtein, E. and Ritov, Y. (2004). Persistence in high-dimensional predictor selection and the virtue of overparametrization. Bernoulli 10 971--988.
Mathematical Reviews (MathSciNet): MR2108039
Digital Object Identifier: doi:10.3150/bj/1106314846
Project Euclid: euclid.bj/1106314846
Knight, K. and Fu, W. (2000). Asymptotics for lasso-type estimators. Ann. Statist. 28 1356--1378.
Mathematical Reviews (MathSciNet): MR1805787
Digital Object Identifier: doi:10.1214/aos/1015957397
Project Euclid: euclid.aos/1015957397
Zentralblatt MATH: 1105.62357
Leng, C., Lin, Y. and Wahba, G. (2006). A note on the lasso and related procedures in model selection. Statist. Sinica 16 1273--1284.
Mathematical Reviews (MathSciNet): MR2327490
Li, Y. and Zhu, J. (2006). The $l_1$-norm quantile regression. Technical report, Dept. Statistics, Univ. Michigan.
Meinshausen, N. and Bühlmann, P. (2006). High-dimensional graphs and variable selection with the lasso. Ann. Statist. 34 1436--1462.
Mathematical Reviews (MathSciNet): MR2278363
Digital Object Identifier: doi:10.1214/009053606000000281
Project Euclid: euclid.aos/1152540754
Zentralblatt MATH: 1113.62082
Meinshausen, N. and Yu, B. (2007). Lasso-type recovery of sparse representations for high-dimensional data. Ann. Statist. To appear.
Mathematical Reviews (MathSciNet): MR2488351
Zentralblatt MATH: 1155.62050
Digital Object Identifier: doi:10.1214/07-AOS582
Project Euclid: euclid.aos/1232115934
Osborne, M., Presnell, B. and Turlach, B. (2000). On the LASSO and its dual. J. Comput. Graph. Statist. 9 319--337.
Mathematical Reviews (MathSciNet): MR1822089
Digital Object Identifier: doi:10.2307/1390657
JSTOR: links.jstor.org
Rosset, S. and Zhu, J. (2007). Piecewise linear regularized solution paths. Ann. Statist. 35 1012--1030.
Mathematical Reviews (MathSciNet): MR2341696
Digital Object Identifier: doi:10.1214/009053606000001370
Project Euclid: euclid.aos/1185303996
Zentralblatt MATH: 05186959
Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. Ser. B 58 267--288.
Mathematical Reviews (MathSciNet): MR1379242
JSTOR: links.jstor.org
Tropp, J. (2006). Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Trans. Inform. Theory 52 1030--1051.
Mathematical Reviews (MathSciNet): MR2238069
Digital Object Identifier: doi:10.1109/TIT.2005.864420
van de Geer, S. (2006). High-dimensional generalized linear models and the lasso. Technical Report 133, ETH Zürich.
Wainwright, M. (2006). Sharp thresholds for high-dimensional and noisy recovery of sparsity. Available at arxiv.org/abs/math/0605740.
Wainwright, M. (2007). Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting. Technical Report 725, Dept. Statistics, Univ. California, Berkeley.
Zhang, C.-H. and Huang, J. (2006). Model-selection consistency of the lasso in high-dimensional linear regression. Technical Report 003, Dept. Statistics, Rutgers Univ.
Zhao, P. and Yu, B. (2006). On model selection consistency of Lasso. J. Mach. Learn. Res. 7 2541--2563.
Mathematical Reviews (MathSciNet): MR2274449
Zou, H. (2006). The adaptive lasso and its oracle properties. J. Amer. Statist. Assoc. 101 1418--1429.
Mathematical Reviews (MathSciNet): MR2279469
Digital Object Identifier: doi:10.1198/016214506000000735
Zentralblatt MATH: 1171.62326
