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
Proceedings ArticleDOI
Doubly Sparse Bayesian Kernel Logistic Regression
Atsushi Kojima,Toshihisa Tanaka +1 more
TL;DR: The proposed method can select effective features and estimate sparse weight coefficients by introducing the binary vectors into the kernel regression model using the linear sum of kernel functions corresponding to input patterns.
Posted Content
Convex Hull Approximation of Nearly Optimal Lasso Solutions
Satoshi Hara,Takanori Maehara +1 more
TL;DR: The experimental results indicate that the proposed algorithm can approximate the solution set well and also indicate that it can obtain Lasso solutions with a large diversity.
Book ChapterDOI
Mentor Pattern Identification from Product Usage Logs
Ankur Garg,Aman Kharb,Yash H. Malviya,J. P. Sagar,Atanu R. Sinha,Iftikhar Ahamath Burhanuddin,Sunav Choudhary +6 more
TL;DR: In this paper, an unsupervised pattern identification problem from product usage logs is formulated as identifying a set of users (mentors) that satisfy three mentor qualification metrics: (a) the mentor set is small, (b) every user is close to some mentor as per usage pattern, and (c) every feature has been used by some mentor.
Proceedings ArticleDOI
Smoothly Giving up: Robustness for Simple Models
TL;DR: The authors use the margin-based α$-loss, which continuously tunes between canonical convex and quasi-convex losses, to robustly train simple models, and show that the α$ hyperparameter smoothly introduces non-Convexity and offers the benefit of"giving up" on noisy training examples.
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