Fetching the paper…
Reading the bibliography…
We propose a novel stochastic gradient method---semi-stochastic coordinate descent (S2CD)---for the problem of minimizing a strongly convex function represented as the average of a large number of smooth convex functions: $f(x)=\tfrac{1}{n}\sum_i f_i(x)$.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Yurii Nesterov · 2004
Earlier work this paper cites.
Solving large scale linear prediction problems using stochastic gradient descent algorithms
Tong Zhang · 2004
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Earlier work this paper cites.
Parallel coordinate descent methods for big data optimization
Peter Richtárik and Martin Takáč · 2012
Earlier work this paper cites.
Accelerated, parallel and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2013
Earlier work this paper cites.
Smooth minimization of nonsmooth functions with parallel coordinate descent methods
Olivier Fercoq and Peter Richtárik · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Semi-stochastic gradient descent methods
Jakub Konečný and Peter Richtárik · 2013
Cited alongside, same era.
Distributed coordinate descent for learning with big data
Peter Richtárik and Martin Takáč · 2013
Cited alongside, same era.
On optimal probabilities in stochastic coordinate descent methods
Peter Richtárik and Martin Takáč · 2013
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2013
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Closest in time.
Fast distributed coordinate descent for non-strongly convex losses
Olivier Fercoq, Zheng Qu, Peter Richtárik, and Martin Takáč · 2014
Closest in time.
S2CD: Semi-stochastic coordinate descent
Jakub Konečný, Zheng Qu, and Peter Richtárik · 2014
Closest in time.
mS2GD:minibatch semi-stochastic gradient descent in the proximal setup
Jie Konečný, Liu, Peter Richtárik, and Martin Takávc · 2014
Closest in time.
Randomized dual coordinate ascent with arbitrary sampling
Zheng Qu, Peter Richtárik, and Tong Zhang · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Minibatch primal and dual methods for support vector machines
Martin Takáč, Avleen Bijral, Peter Richtárik, and Nathan Srebro · 2013
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takáč · 2014
Closest in time.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Closest in time.
Stochastic optimization with importance sampling
Peilin Zhao and Tong Zhang · 2014
Closest in time.