Fetching the paper…
Reading the bibliography…
We propose a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent applied to the problem of minimizing a strongly convex composite function represented as the sum of an average of a large number of smooth convex functions, and simple nonsmooth convex function.
Solving large scale linear prediction using stochastic gradient descent algorithms
Tong Zhang · 2004
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
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.
Better mini-batch algorithms via accelerated gradient methods
Andrew Cotter, Ohad Shamir, Nati Srebro, and Karthik Sridharan · 2011
Earlier work this paper cites.
Pegasos: Primal estimated sub-gradient solver for svm
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro, and Andrew Cotter · 2011
Earlier work this paper cites.
Optimal distributed online prediction using mini-batches
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao · 2012
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
Cited alongside, same era.
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 methods for composite minimization
Ion Necoara and Dragos Clipici · 2013
Cited alongside, same era.
Distributed coordinate descent method for learning with big data
Peter Richtárik and Martin Takáč · 2013
Cited alongside, same era.
Fast distributed coordinate descent for non-strongly convex losses
Olivier Fercoq, Zheng Qu, Peter Richtárik, and Martin Takáč · 2014
Closest in time.
Communication-efficient distributed dual coordinate ascent
Martin Jaggi, Virginia Smith, Martin Takáč, Jonathan Terhorst, Thomas Hofmann, and Michael I Jordan · 2014
Closest in time.
Distributed block coordinate descent for minimizing partially separable functions
Jakub Mareček, Peter Richtárik, and Martin Takáč · 2014
Closest in time.
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
Ion Necoara and Andrei Patrascu · 2014
Closest in time.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takáč · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Accelerated mini-batch stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Mini-batch primal and dual methods for SVMs
Martin Takáč, Avleen Singh Bijral, Peter Richtárik, and Nathan Srebro · 2013
Cited alongside, same era.
Lin Xiao and Tong Zhang · 2014
Closest in time.
Accelerating minibatch stochastic gradient descent using stratified sampling
Peilin Zhao and Tong Zhang · 2014
Closest in time.