Affiliation:
1. School of Mathematics and Computer Science, Gannan Normal University, Ganzhou 341000, China
Abstract
We present a new penalized method for estimation in sparse logistic regression models with a group structure. Group sparsity implies that we should consider the Group Lasso penalty. In contrast to penalized log-likelihood estimation, our method can be viewed as a penalized weighted score function method. Under some mild conditions, we provide non-asymptotic oracle inequalities promoting the group sparsity of predictors. A modified block coordinate descent algorithm based on a weighted score function is also employed. The net advantage of our algorithm over existing Group Lasso-type procedures is that the tuning parameter can be pre-specified. The simulations show that this algorithm is considerably faster and more stable than competing methods. Finally, we illustrate our methodology with two real data sets.
Funder
Educational Commission of Jiangxi Province of China
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference34 articles.
1. Regression shrinkage and selection via the lasso;Tibshirani;J. R. Stat. Soc. Ser. Stat. Methodol.,1996
2. Variable selection via nonconcave penalized likelihood and its oracle properties;Fan;J. Am. Stat. Assoc.,2001
3. Regularization and variable selection via the elastic net;Zou;J. R. Stat. Soc. Ser. Stat. Methodol.,2005
4. The Dantzig selector: Statistical estimation when p is much larger than n;Candes;Ann. Stat.,2007
5. Nearly unbiased variable selection under minimax concave penalty;Zhang;Ann. Stat.,2010