A Method for Large-Scale l1-Regularized Logistic Regression

Logistic regression with 1 regularization has been proposed as a promising method for feature selection in classification problems. Several specialized solution methods have been proposed for 1-regularized logistic regression problems (LRPs). However, existing methods do not scale well to large problems that arise in many practical settings. In this paper we describe an ef- ficient interior-point method for solving 1-regularized LRPs. Small problems with up to a thousand or so features and examples can be solved in seconds on a PC. A variation on the basic method, that uses a preconditioned conjugate gradient method to compute the search step, can solve large sparse problems, with a million features and examples (e. g. , the 20 Newsgroups data set), in a few tens of minutes, on a PC. Numerical experiments show that our method outperforms standard methods for solving convex optimization problems as well as other methods specifically designed for 1regularized LRPs.

Authors

• Kwangmoo Koh Seung-Jean Kim

Keywords

No keywords are indexed for this paper.