SparseNet: Coordinate Descent With Nonconvex Penalties.
SparseNet: Coordinate Descent With Nonconvex Penalties.
复制标题
DOI:
10.1198/jasa.2011.tm09738
复制
发表时间:
2011
影响因子:
3.7
通讯作者:
Hastie T
中科院分区:
文献类型:
--
作者:
Mazumder R;Friedman JH;Hastie T
We address the problem of sparse selection in linear models. A number of nonconvex penalties have been proposed in the literature for this purpose, along with a variety of convex-relaxation algorithms for finding good solutions. In this article we pursue a coordinate-descent approach for optimization, and study its convergence properties. We characterize the properties of penalties suitable for this approach, study their corresponding threshold functions, and describe a df-standardizing reparametrization that assists our pathwise algorithm. The MC+ penalty is ideally suited to this task, and we use it to demonstrate the performance of our algorithm. Certain technical derivations and experiments related to this article are included in the Supplementary Materials section.
登录
查看更多内容
影响因子:
4.5
作者:
Zhang, Cun-Hui
通讯作者:
Zhang, Cun-Hui
影响因子:
4.5
作者:
Zou, Hui;Li, Runze
通讯作者:
Li, Runze
影响因子:
3
作者:
Donoho, DL
通讯作者:
Donoho, DL
影响因子:
4.5
作者:
Zhang, Cun-Hui;Huang, Jian
通讯作者:
Huang, Jian
影响因子:
2.1
作者:
Osborne, MR;Presnell, B;Turlach, BA
通讯作者:
Turlach, BA