Open AccessProceedings Article
EfficientL 1 regularized logistic regression
Sun-In Lee,Honglak Lee,Pieter Abbeel,Andrew Y. Ng +3 more
- pp 401-408
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
Proceedings Article
Consistent and Efficient Nonparametric Different-Feature Selection.
TL;DR: The proposed feature selection method is nonparametric and does not assume any specific parametric models on data distributions and it is proved that the proposed method provides a consistent estimator of features under mild conditions.
Posted Content
Second-order orthant-based methods with enriched Hessian information for sparse $\ell_1$-optimization
TL;DR: A second order algorithm, based on orthantwise directions, for solving optimization problems involving the sparsity enhancing $$\ell _1$$ℓ1-norm, and it is proved that a reduced version of the method is equivalent to a semismooth Newton algorithm applied to the optimality condition.
Proceedings ArticleDOI
Enhancing ICA performance by exploiting sparsity: Application to FMRI analysis
TL;DR: In this paper, a new variant of ICA by entropy bound minimization (ICA-EBM) is proposed, which exploits sparsity to relax the assumption that sources are statistically independent.
Journal ArticleDOI
Second-order orthant-based methods with enriched Hessian information for sparse $$\ell _1$$ℓ1-optimization
TL;DR: In this article, a second order algorithm based on orthantwise directions was proposed for solving optimization problems involving the sparsity enhancing $$\ell _1$$l1-norm, which is equivalent to a semismooth Newton algorithm applied to the optimality condition under a specific choice of the algorithm parameters.
Journal ArticleDOI
Process-Monitoring-for-Quality — A Model Selection Criterion
TL;DR: The Penalized Maximum Probability of Correct Decision (PMPCD) is developed to solve the posed tradeoff and induces parsimony by selecting the model with the minimum number of features needed for an effective/efficient defect detection.
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