Efficient sparse group feature selection via nonconvex optimization

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 284-292

  Xiang, Shuo ^a,b   Shen, Xiaotong ^c   Ye, Jieping ^a,b  

^a Arizona State University   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; NUMERICAL METHODS; PARAMETER ESTIMATION;

COUPLED CONSTRAINTS; GROUP STRUCTURE; HIGH DIMENSIONAL DATA; NONCONVEX; NONCONVEX OPTIMIZATION; NUMERICAL RESULTS; OPTIMIZATION ALGORITHMS; REAL-WORLD;

OPTIMIZATION;

EID: 84897549285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Bach, Francis, Jenatton, Rodolphe, Mairal, Julien, and Obozinski, Guillaume. Convex Optimization with Sparsity-Inducing Norms. 2010.
2. Beck, A. and Teboulle, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1):183-202, 2009.
3. Bickel, P.J., Ritov, Y., and Tsybakov, A.B. Simultaneous analysis of lasso and dantzig selector. The Annals of Statistics, 37(4):1705-1732, 2009.
4. Boyd, S. and Vandenberghe, L. Convex Optimization. Cambridge University Press, 2004.
5. Boyd, S., Parikh, N., Chu, E., Peleato, B., and Eckstein, J. Distributed optimization and statistical learning via the alternating direction method of multipliers. Now Publishers, 2011.
6. Breheny, P. and Huang, J. Penalized methods for bi-level variable selection. Statistics and its interface, 2(3):369, 2009.
7. Combettes, P.L. and Pesquet, J.C. Proximal splitting methods in signal processing. Fixed-Point Algorithms for Inverse Problems in Science and Engineering, 2010.
8. Donoho, D.L. De-noising by soft-thresholding. Information Theory, IEEE Transactions on, 41(3):613-627, 2002. ISSN 0018-9448.
9. 1-ball for learning in high dimensions. In Proceedings of the 25th International Conference on Machine Learning, pp. 272-279. ACM, 2008.
10. Fan, J. and Li, R. Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association, 96(456):1348-1360, 2001. (Pubitemid 33695585)
11. Frank, A. and Asuncion, A. UCI machine learning repository, 2010. URL http://archive.ics.uci.edu/ml.
12. Friedman, J., Hastie, T., and Tibshirani, R. A note on the group lasso and a sparse group lasso. Arxiv preprint arXiv:1001.0736, 2010.
13. Grant, M. and Boyd, S. CVX: Matlab software for disciplined convex programming, version 1.21. http://cvxr.com/cvx, April 2011.
14. Huang, J. and Zhang, T. The benefit of group sparsity. The Annals of Statistics, 38(4): 1978-2004, 2010.
15. Huang, J., Ma, S., Xie, H., and Zhang, C.H. A group bridge approach for variable selection. Biometrika, 96(2):339-355, 2009.
16. Huang, J., Breheny, P., and Ma, S. A selective review of group selection in high dimensional models. arXiv preprint arXiv: 1204-6491, 2012.
17. Kolmogorov, A.N. and Tihomirov, V.M. e-Entropy and e-capacity of sets in functional spaces. American Mathematical Society, 1961.
18. Mazumder, R., Friedman, J.H., and Hastie, T. Sparsenet: Coordinate descent with nonconvex penalties. Journal of the American Statistical Association, 106(495):1125-1138, 2011.
19. Meier, L., Van De Geer, S., and Biihlmann, P. The group lasso for logistic regression. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 70(1):53-71, 2008.
20. Natarajan, B. K. Sparse approximation solutions to linear systems. SIAM J. Comput., 24(2):227-234, 1995.
21. Nesterov, Y. Gradient methods for minimizing composite objective function. CORE Discussion Papers, 2007.
22. Schmidt, M., Le Roux, N., Bach, F., et al. Convergence rates of inexact proximal-gradient methods for convex optimization. In NIPS'11-25th Annual Conference on Neural Information Processing Systems, 2011.
23. Shen, X., Pan, W., and Zhu, Y. Likelihood-based selection and sharp parameter estimation. Journal of American Statistical Association, 107:223-232, 2012.
24. Tao, P.D. and An, LTH. Convex analysis approach to dc programming: Theory, algorithms and applications. Acta Math. Vietnam, 22(1):289-355, 1997.
25. Tibshirani, R. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Statistical Methodology), pp. 267-288, 1996.
26. Van De Geer, S.A. and Biihlmann, P. On the conditions used to prove oracle results for the lasso. Electronic Journal of Statistics, 3:1360-1392, 2009.
27. Wang, L., Chen, G., and Li, H. Group scad regression analysis for microarray time course gene expression data. Bioinformatics, 23(12):1486-1494, 2007. (Pubitemid 47244473)
28. Yang, H., Xu, Z., King, I., and Lyu, M. Online learning for group lasso. In Proceedings of the 27th International Conference on Machine Learning, pp. 1191-1198. ACM, 2010.
29. Yuan, M. and Lin, Y. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 68(1):49-67, 2006. (Pubitemid 43415335)
30. Zhang, D. and Shen, D. Multi-modal multi-task learning for joint prediction of multiple regression and classification variables in alzheimer's disease, 2011.
31. Zhang, T. Analysis of multi-stage convex relaxation for sparse regularization. The Journal of Machine Learning Research, 11:1081-1107, 2010.
32. Zhang, T. Multi-stage convex relaxation for feature selection. arXiv:1106.0565v2, 2011.
33. Zhao, P. and Yu, B. On model selection consistency of lasso. The Journal of Machine Learning Research, 7: 2541-2563, 2006. (Pubitemid 44866738)