Robust Parametric Classification and Variable Selection by a Minimum Distance Criterion

2014-05-19T17:21:54Z (GMT) by Eric C. Chi David W. Scott
<div><p>We investigate a robust penalized logistic regression algorithm based on a minimum distance criterion. Influential outliers are often associated with the explosion of parameter vector estimates, but in the context of standard logistic regression, the bias due to outliers always causes the parameter vector to implode, that is, shrink toward the zero vector. Thus, using LASSO-like penalties to perform variable selection in the presence of outliers can result in missed detections of relevant covariates. We show that by choosing a minimum distance criterion together with an elastic net penalty, we can simultaneously find a parsimonious model and avoid estimation implosion even in the presence of many outliers in the important small <i>n</i> large <i>p</i> situation. Minimizing the penalized minimum distance criterion is a challenging problem due to its nonconvexity. To meet the challenge, we develop a simple and efficient MM (majorization–minimization) algorithm that can be adapted gracefully to the small <i>n</i> large <i>p</i> context. Performance of our algorithm is evaluated on simulated and real datasets. This article has supplementary materials available online.</p></div>