SOTAVerified

Distributed Coordinate Descent for L1-regularized Logistic Regression

2014-11-24Code Available0· sign in to hype

Ilya Trofimov, Alexander Genkin

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Solving logistic regression with L1-regularization in distributed settings is an important problem. This problem arises when training dataset is very large and cannot fit the memory of a single machine. We present d-GLMNET, a new algorithm solving logistic regression with L1-regularization in the distributed settings. We empirically show that it is superior over distributed online learning via truncated gradient.

Tasks

Reproductions