Open AccessProceedings Article
EfficientL 1 regularized logistic regression
Sun-In Lee,Honglak Lee,Pieter Abbeel,Andrew Y. Ng +3 more
- pp 401-408
Reads0
Chats0
TLDR
Theoretical results show that the proposed efficient algorithm for L1 regularized logistic regression is guaranteed to converge to the global optimum, and experiments show that it significantly outperforms standard algorithms for solving convex optimization problems.Abstract:
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized logistic regression requires solving a convex optimization problem. However, standard algorithms for solving convex optimization problems do not scale well enough to handle the large datasets encountered in many practical settings. In this paper, we propose an efficient algorithm for L1 regularized logistic regression. Our algorithm iteratively approximates the objective function by a quadratic approximation at the current point, while maintaining the L1 constraint. In each iteration, it uses the efficient LARS (Least Angle Regression) algorithm to solve the resulting L1 constrained quadratic optimization problem. Our theoretical results show that our algorithm is guaranteed to converge to the global optimum. Our experiments show that our algorithm significantly outperforms standard algorithms for solving convex optimization problems. Moreover, our algorithm outperforms four previously published algorithms that were specifically designed to solve the L1 regularized logistic regression problem.read more
Citations
More filters
Journal Article
An improved GLMNET for L1-regularized logistic regression
TL;DR: In this paper, an improved GLMNET is proposed to address some theoretical and implementation issues, which is shown to be more efficient than CDN for L1-regularized logistic regression.
Journal Article
Estimation of Sparse Binary Pairwise Markov Networks using Pseudo-likelihoods
Holger Höfling,Robert Tibshirani +1 more
TL;DR: An approximate procedure based on the pseudo-likelihood of Besag (1975) is implemented and this procedure is faster than the competing exact method proposed by Lee, Ganapathi, and Koller (2006a) and only slightly less accurate.
Journal ArticleDOI
Comparing Random Forest with Logistic Regression for Predicting Class-Imbalanced Civil War Onset Data
TL;DR: This article compares the performance of Random Forests with three versions of logistic regression, and finds that the algorithmic approach provides significantly more accurate predictions of civil war onset in out-of-sample data than any of theLogistic regression models.
Journal ArticleDOI
Weighted Conditional Random Fields for Supervised Interpatient Heartbeat Classification
TL;DR: Experiments show that the proposed method outperforms previously reported heartbeat classification methods, especially for the pathological heartbeats.
Journal ArticleDOI
An overview and comparison of supervised data mining techniques for student exam performance prediction
TL;DR: To exploit the full potential of the student exam performance prediction, it was concluded that adequate data acquisition functionalities and the student interaction with the learning environment is a prerequisite to ensure sufficient amount of data for analysis.
References
More filters
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Book
Generalized Linear Models
Peter McCullagh,John A. Nelder +1 more
TL;DR: In this paper, a generalization of the analysis of variance is given for these models using log- likelihoods, illustrated by examples relating to four distributions; the Normal, Binomial (probit analysis, etc.), Poisson (contingency tables), and gamma (variance components).
Journal ArticleDOI
Generalized Linear Models
TL;DR: This is the rst book on generalized linear models written by authors not mostly associated with the biological sciences, and it is thoroughly enjoyable to read.
Related Papers (5)
Least angle regression
Bradley Efron,Trevor Hastie,Iain M. Johnstone,Robert Tibshirani,Hemant Ishwaran,Keith Knight,Jean-Michel Loubes,Jean-Michel Loubes,Pascal Massart,Pascal Massart,David Madigan,David Madigan,Greg Ridgeway,Greg Ridgeway,Saharon Rosset,Saharon Rosset,Ji Zhu,Robert A. Stine,Berwin A. Turlach,Sanford Weisberg +19 more