Sciweavers

13 search results - page 1 / 3
» Bregman distance to L1 regularized logistic regression
Sort
View
ICPR
2008
IEEE
14 years 6 months ago
Bregman distance to L1 regularized logistic regression
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...
Mithun Das Gupta, Thomas S. Huang
AAAI
2006
13 years 6 months ago
Efficient L1 Regularized Logistic Regression
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...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
AAAI
2007
13 years 7 months ago
A Method for Large-Scale l1-Regularized Logistic Regression
Kwangmoo Koh, Seung-Jean Kim, Stephen P. Boyd
CORR
2011
Springer
205views Education» more  CORR 2011»
12 years 8 months ago
Parallel Coordinate Descent for L1-Regularized Loss Minimization
We propose Shotgun, a parallel coordinate descent algorithm for minimizing L1regularized losses. Though coordinate descent seems inherently sequential, we prove convergence bounds...
Joseph K. Bradley, Aapo Kyrola, Danny Bickson, Car...
COLT
2000
Springer
13 years 9 months ago
Logistic Regression, AdaBoost and Bregman Distances
Michael Collins, Robert E. Schapire, Yoram Singer