Fetching the paper…
Reading the bibliography…
The last decade witnessed a rise in the importance of supervised learning applications involving {\em big data} and {\em big models}.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Strong conical hull intersection property, bounded linear regularity, jameson’s property (g), and error bounds in convex optimization
Heinz H Bauschke, Jonathan M Borwein, and Wu Li · 1999
Earlier work this paper cites.
On approximate solutions of systems of linear inequalities
Alan J Hoffman · 2003
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course (Applied Optimization)
Yurii Nesterov · 2004
Earlier work this paper cites.
Random projection algorithms for convex set intersection problems
A. Nedic · 2010
Earlier work this paper cites.
Stochastic gradient descent with only one projection
Mehrdad Mahdavi, Tianbao Yang, Rong Jin, Shenghuo Zhu, and Jinfeng Yi · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Earlier work this paper cites.
A stochastic gradient method with an exponential convergence rate for finite training sets
Nicolas Le Roux, Mark Schmidt, and Francis Bach · 2012
Earlier work this paper cites.
Proximal stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2012
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Mini-batch primal and dual methods for SVMs
Martin Takáč, Avleen Bijral, Peter Richtárik, and Nathan Srebro · 2013
Earlier work this paper cites.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takáč · 2014
Cited alongside, same era.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Cited alongside, same era.
Accelerated, parallel and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2015
Cited alongside, same era.
Randomized iterative methods for linear systems
Robert Mansel Gower and Peter Richtárik · 2015
Cited alongside, same era.
SARAH: A novel method for machine learning problems using stochastic recursive gradient
Lam Nguyen, Jie Liu, Katya Scheinberg, and Martin Takáč · 2017
Later among the works it cites.
Breaking the nonsmooth barrier: A scalable parallel method for composite optimization
Fabian Pedregosa, Rémi Leblond, and Simon Lacoste-Julien · 2017
Later among the works it cites.
Proximal-proximal-gradient method
Ernest K Ryu and Wotao Yin · 2017
Later among the works it cites.
Proximal alternating penalty algorithms for constrained convex optimization
Quoc Tran-Dinh · 2017
Later among the works it cites.
A richer theory of convex constrained optimization with reduced projections and improved rates
Tianbao Yang, Qihang Lin, and Lijun Zhang · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robert Mansel Gower and Peter Richtárik · 2015
Cited alongside, same era.
A universal catalyst for first-order optimization
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Cited alongside, same era.
Even faster accelerated coordinate descent using non-uniform sampling
Zeyuan Allen-Zhu, Zheng Qu, Peter Richtárik, and Yang Yuan · 2016
Cited alongside, same era.
Parallel coordinate descent methods for big data optimization
Peter Richtárik and Martin Takáč · 2016
Cited alongside, same era.
Katyusha: The first direct acceleration of stochastic gradient methods
Zeyuan Allen-Zhu · 2017
Cited alongside, same era.
Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
Robert Mansel Gower and Peter Richtárik · 2017
Cited alongside, same era.
Importance sampling for minibatches
Dominik Csiba and Peter Richtárik · 2018
Closest in time.
Accelerated stochastic matrix inversion: General theory and speeding up BFGS rules for faster second-order optimization
Robert Mansel Gower, Filip Hanzely, Peter Richtárik, and Sebastian Stich · 2018
Closest in time.
Convex optimization over intersection of simple sets: improved convergence rate guarantees via an exact penalty approach
Achintya Kundu, Francis Bach, and Chiranjib Bhattacharya · 2018
Closest in time.
Randomized projection methods for convex feasibility problems: conditioning and convergence rates
Ion Necoara, Peter Richtárik, and Andrei Patrascu · 2018
Closest in time.
SGD and Hogwild! Convergence without the bounded gradients assumption
Lam Nguyen, Phuong Ha Nguyen, Marten van Dijk, Peter Richtarik, Katya Scheinberg, and Martin Takáč · 2018
Closest in time.