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
Self-taught learning
Andrew Y. Ng,Rajat Raina +1 more
TL;DR: The centerpiece of this work is a self-taught learning algorithm based on an optimization problem called "sparse coding" that uses unlabeled data to learn a new representation for complex, high-dimensional inputs, and then applies supervised learning over this representation.
Proceedings Article
Evaluating Bayesian and L1 Approaches for Sparse Unsupervised Learning .
TL;DR: The need to re-assess the wide use of L1 methods in sparsity-reliant applications is highlighted, particularly when the authors care about generalising to previously unseen data, and an alternative that, over many varying conditions, provides improved generalisation performance is provided.
Journal ArticleDOI
False ventricular tachycardia alarm suppression in the ICU based on the discrete wavelet transform in the ECG signal
TL;DR: A robust methodology that, without the need for additional non-ECG waveforms, suppresses false positive ventricular tachycardia (VT) alarms without resulting in false negative alarms is developed.
Proceedings Article
Enumerate Lasso Solutions for Feature Selection.
Satoshi Hara,Takanori Maehara +1 more
TL;DR: It is proved that by enumerating solutions, the proposed method can recover a true feature set exactly under less restrictive conditions compared with the ordinary Lasso.
Proceedings ArticleDOI
Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation
TL;DR: Adaptive relaxed ADMM (ARADMM) as discussed by the authors is a generalization of ADMM that often achieves better performance, but its efficiency depends strongly on algorithm parameters that must be chosen by an expert user.
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