期刊
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
卷 106, 期 495, 页码 1125-1138出版社
AMER STATISTICAL ASSOC
DOI: 10.1198/jasa.2011.tm09738
关键词
Degrees of freedom; LASSO; Nonconvex optimization; Regularization surface; Sparse regression; Variable selection
资金
- National Science Foundation [DMS-1007719]
- National Institutes of Health [RO1-EB001988-12]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据