scholarly journals Overlap Group Lasso for Variable Selection in Nonlinear Nonparametric System Identification

Author(s):  
Changming Cheng ◽  
Er-wei Bai
Biometrika ◽  
2009 ◽  
Vol 96 (2) ◽  
pp. 339-355 ◽  
Author(s):  
Jian Huang ◽  
Shuange Ma ◽  
Huiliang Xie ◽  
Cun-Hui Zhang

Abstract In multiple regression problems when covariates can be naturally grouped, it is important to carry out feature selection at the group and within-group individual variable levels simultaneously. The existing methods, including the lasso and group lasso, are designed for either variable selection or group selection, but not for both. We propose a group bridge approach that is capable of simultaneous selection at both the group and within-group individual variable levels. The proposed approach is a penalized regularization method that uses a specially designed group bridge penalty. It has the oracle group selection property, in that it can correctly select important groups with probability converging to one. In contrast, the group lasso and group least angle regression methods in general do not possess such an oracle property in group selection. Simulation studies indicate that the group bridge has superior performance in group and individual variable selection relative to several existing methods.


2014 ◽  
Vol 85 (13) ◽  
pp. 2750-2760 ◽  
Author(s):  
Kuangnan Fang ◽  
Xiaoyan Wang ◽  
Shengwei Zhang ◽  
Jianping Zhu ◽  
Shuangge Ma

2016 ◽  
Vol 4 (5) ◽  
pp. 476-488
Author(s):  
Xiaodong Xie ◽  
Shaozhi Zheng

AbstractCox’s proportional hazard models with time-varying coefficients have much flexibility for modeling the dynamic of covariate effects. Although many variable selection procedures have been developed for Coxs proportional hazard model, the study of such models with time-varying coefficients appears to be limited. The variable selection methods involving nonconvex penalty function, such as the minimax concave penalty (MCP), introduces numerical challenge, but they still have attractive theoretical properties and were indicated that they are worth to be alternatives of other competitive methods. We propose a group MCP method that uses B-spline basis to expand coefficients and maximizes the log partial likelihood with nonconvex penalties on regression coefficients in groups. A fast, iterative group shooting algorithm is carried out for model selection and estimation. Under some appropriate conditions, the simulated example shows that our method performs competitively with the group lasso method. By comparison, the group MCP method and group lasso select the same amount of important covariates, but group MCP method tends to outperform the group lasso method in selection of unimportant covariates.


Sign in / Sign up

Export Citation Format

Share Document