mlsanityData to 14 Oct 2026

Distributed Mini-Batch SDCA

arXiv 1507.08322 ↗First posted 29 Jul 2015cs.LG math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

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).

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Jul 2015.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2.

2 papers.