pith. sign in

arxiv: 1712.09131 · v1 · pith:PSYL3OPRnew · submitted 2017-12-25 · 🧮 math.OC · cs.AI

A Random Block-Coordinate Douglas-Rachford Splitting Method with Low Computational Complexity for Binary Logistic Regression

classification 🧮 math.OC cs.AI
keywords logisticalgorithmapproachdouglas-rachfordmethodregressionsplittingstochastic
0
0 comments X
read the original abstract

In this paper, we propose a new optimization algorithm for sparse logistic regression based on a stochastic version of the Douglas-Rachford splitting method. Our algorithm sweeps the training set by randomly selecting a mini-batch of data at each iteration, and it allows us to update the variables in a block coordinate manner. Our approach leverages the proximity operator of the logistic loss, which is expressed with the generalized Lambert W function. Experiments carried out on standard datasets demonstrate the efficiency of our approach w.r.t. stochastic gradient-like methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.