Fetching the paper…
Reading the bibliography…
Uniform sampling of training data has been commonly used in traditional stochastic optimization algorithms such as Proximal Stochastic Gradient Descent (prox-SGD) and Proximal Stochastic Dual Coordinate Ascent (prox-SDCA).
On the convergence of the coordinate descent method for convex differentiable minimization
Zhi-Quan Luo and Paul Tseng · 1992
Earlier work this paper cites.
Successive overrelaxation for support vector machines
Olvi L Mangasarian and David R Musicant · 1999
Earlier work this paper cites.
Stochastic approximation and recursive algorithms and applications
Harold J Kushner and George Yin · 2003
Earlier work this paper cites.
Learning probabilistic linear-threshold classifiers via selective sampling
Nicolò Cesa-Bianchi, Alex Conconi, and Claudio Gentile · 2003
Earlier work this paper cites.
Solving large scale linear prediction problems using stochastic gradient descent algorithms
Tong Zhang · 2004
Earlier work this paper cites.
Convex analysis and nonlinear optimization: theory and examples
Jonathan Borwein and Adrian Lewis · 2006
Earlier work this paper cites.
Prediction, learning, and games
Nicolò Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Pegasos: Primal estimated sub-gradient solver for svm
Shai Shalev-Shwartz, Yoram Singer, and Nathan Srebro · 2007
Earlier work this paper cites.
A dual coordinate descent method for large-scale linear svm
Cho-Jui Hsieh, Kai-Wei Chang, Chih-Jen Lin, S Sathiya Keerthi, and Sellamanickam Sundararajan · 2008
Earlier work this paper cites.
Linear classification and selective sampling under low noise conditions
Giovanni Cavallanti, Nicolò Cesa-Bianchi, and Claudio Gentile · 2008
Earlier work this paper cites.
Efficient online and batch learning using forward backward splitting
John Duchi and Yoram Singer · 2009
Earlier work this paper cites.
A randomized kaczmarz algorithm with exponential convergence
Thomas Strohmer and Roman Vershynin · 2009
Cited alongside, same era.
Robust bounds for classification via selective sampling
Nicolò Cesa-Bianchi, Claudio Gentile, and Francesco Orabona · 2009
Cited alongside, same era.
Composite objective mirror descent
John C. Duchi, Shai Shalev-Shwartz, Yoram Singer, and Ambuj Tewari · 2010
Cited alongside, same era.
Making gradient descent optimal for strongly convex stochastic optimization
Alexander Rakhlin, Ohad Shamir, and Karthik Sridharan · 2011
Cited alongside, same era.
Stochastic methods for l 1 {}_{\mbox{1}}
Shai Shalev-Shwartz and Ambuj Tewari · 2011
Cited alongside, same era.
Better algorithms for selective sampling
Francesco Orabona and Nicolò Cesa-Bianchi · 2011
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takác · 2012
Later among the works it cites.
A stochastic gradient method with an exponential convergence _rate for finite training sets
Nicolas L Roux, Mark Schmidt, and Francis R Bach · 2012
Later among the works it cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yu Nesterov · 2012
Later among the works it cites.
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
Ohad Shamir and Tong Zhang · 2013
Later among the works it cites.
Stochastic dual coordinate ascent methods for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Later among the works it cites.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Learning noisy linear classifiers via adaptive and selective sampling
Giovanni Cavallanti, Nicolò Cesa-Bianchi, and Claudio Gentile · 2011
Cited alongside, same era.
Stochastic block-coordinate frank-wolfe optimization for structural svms
Simon Lacoste-Julien, Martin Jaggi, Mark W. Schmidt, and Patrick Pletscher · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Cited alongside, same era.
Proximal stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2012
Cited alongside, same era.
Proximal stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2012
Cited alongside, same era.
Yin Tat Lee and Aaron Sidford · 2013
Later among the works it cites.
Accelerated mini-batch stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2013
Later among the works it cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Later among the works it cites.
Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm
Deanna Needell, Nathan Srebro, and Rachel Ward · 2014
Closest in time.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Closest in time.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2014
Closest in time.