.png){kind=icon}
返回
Variable selection using MM algorithms
.png){kind=icon}
OA
AI
DOI：10.1214/009053605000000200.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Variable selection is fundamental to high-dimensional statistical modeling. Many variable selection techniques may be implemented by maximum penalized likelihood using various penalty functions. Optimizing the penalized likelihood function is often challenging because it may be nondifferentiable and/or nonconcave. This article proposes a new class of algorithms for finding a maximizer of the penalized likelihood for a broad class of penalty functions. These algorithms operate by perturbing the penalty function slightly to render it differentiable, then optimizing this differentiable function using a minorize-maximize (MM) algorithm. MM algorithms are useful extensions of the well-known class of EM algorithms, a fact that allows us to analyze the local and global convergence of the proposed algorithm using some of the techniques employed for EM algorithms. In particular, we prove that when our MM algorithms converge, they must converge to a desirable point; we also discuss conditions under which this convergence may be guaranteed. We exploit the Newton-Raphson-like aspect of these algorithms to propose a sandwich estimator for the standard errors of the estimators. Our method performs well in numerical tests.
Keyword:
AIC
BIC
EM algorithm
LASSO
MM algorithm
penalized likelihood
oracle estimator
SCAD
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
暂无机构信息
引用论文
Geoheritage Education as a Gateway to Developing a Conservation Ethic in High School Students from China and the USA.png)
Geoheritage
GeoheritageIF0
PREAI
分享收藏分享收藏Nonconcave penalized likelihood with a diverging number of parameters具有不同数量参数的非凹惩罚似然ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏
查看更多内容