Multi-stage convex relaxation for feature selection

Bernoulli

Volumn 19, Issue 5 B, 2013, Pages 2277-2293

  Zhang, Tong ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Multi stage convex relaxation; Non convex penalty; Variable selection

Indexed keywords

EID: 84891952223     PISSN: 13507265     EISSN: None     Source Type: Journal    
DOI: 10.3150/12-BEJ452     Document Type: Article

References (20)

1. Bickel, P.J., Ritov, Y. and Tsybakov, A.B. (2009). Simultaneous analysis of lasso and Dantzig selector. Ann. Statist. 37 1705-1732. MR2533469
2. Bunea, F., Tsybakov, A. and Wegkamp, M. (2007). Sparsity oracle inequalities for the Lasso. Electron. J. Stat. 1 169-194. MR2312149
3. Candes, E.J. and Tao, T. (2005). Decoding by linear programming. IEEE Trans. Inform. Theory 51 4203-4215. MR2243152
4. 1 minimization. J. Fourier Anal. Appl. 14 877-905. MR2461611
5. Fan, J. and Li, R. (2001). Variable selection via nonconcave penalized likelihood and its oracle properties. J. Amer. Statist. Assoc. 96 1348-1360. MR1946581
6. Koltchinskii, V. (2009). Sparsity in penalized empirical risk minimization. Ann. Inst. Henri Poincaré Probab. Stat. 45 7-57.
7. Lounici, K. (2008). Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators. Electron. J. Stat. 2 90-102. MR2386087
8. Meinshausen, N. and Bühlmann, P. (2006). High-dimensional graphs and variable selection with the lasso. Ann. Statist. 34 1436-1462. MR2278363
9. Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. Ser. B 58 267-288. MR1379242
10. van de Geer, S.A. and Bühlmann, P. (2009). On the conditions used to prove oracle results for the Lasso. Electron. J. Stat. 3 1360-1392. MR2576316
11. 1- constrained quadratic programming (Lasso). IEEE Trans. Inform. Theory 55 2183-2202. MR2729873
12. 2 methods for finding sparse solutions. Journal of Selected Topics in Signal Processing 4 317-329.
13. Zhang, C.H. (2010). Nearly unbiased variable selection under minimax concave penalty. Ann. Statist. 38 894-942. MR2604701
14. Zhang, C.H. and Huang, J. (2008). The sparsity and bias of the LASSO selection in high-dimensional linear regression. Ann. Statist. 36 1567-1594. MR2435448
15. 1 regularization. Ann. Statist. 37 2109-2144. MR2543687
16. Zhang, T. (2010). Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11 1081-1107. MR2629825
17. Zhang, T. (2011). Adaptive forward-backward greedy algorithm for learning sparse representations. IEEE Trans. Inform. Theory 57 4689-4708. MR2840485
18. Zhao, P. and Yu, B. (2006). On model selection consistency of Lasso. J. Mach. Learn. Res. 7 2541-2563. MR2274449
19. Zou, H. (2006). The adaptive lasso and its oracle properties. J. Amer. Statist. Assoc. 101 1418-1429. MR2279469
20. Zou, H. and Li, R. (2008). One-step sparse estimates in nonconcave penalized likelihood models. Ann. Statist. 36 1509-1533. MR2435443