pith. sign in

arxiv: 1507.08322 · v1 · pith:LSKCS775new · submitted 2015-07-29 · 💻 cs.LG · math.OC

Distributed Mini-Batch SDCA

classification 💻 cs.LG math.OC
keywords analysisdatalossacrossallowsascentcombinescoordinate
0
0 comments X
read the original abstract

We present an improved analysis of mini-batched stochastic dual coordinate ascent for regularized empirical loss minimization (i.e. SVM and SVM-type objectives). Our analysis allows for flexible sampling schemes, including where data is distribute across machines, and combines a dependence on the smoothness of the loss and/or the data spread (measured through the spectral norm).

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.