Fetching the paper…
Reading the bibliography…
In this work we introduce the concept of an Underestimate Sequence (UES), which is motivated by Nesterov's estimate sequence.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yurii Nesterov · 2005
Earlier work this paper cites.
Gradient methods for minimizing composite objective function
Yurii Nesterov · 2007
Earlier work this paper cites.
Accelerating the cubic regularization of newton’s method on convex problems
Yurii Nesterov · 2008
Earlier work this paper cites.
Estimate sequence methods: extensions and approximations
Michel Baes · 2009
Earlier work this paper cites.
LIBSVM: a library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
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.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework
Saeed Ghadimi and Guanghui Lan · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yu Nesterov · 2012
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Yurii Nesterov · 2013
Cited alongside, same era.
Accelerated mini-batch stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Communication-efficient distributed dual coordinate ascent
Martin Jaggi, Virginia Smith, Martin Takac, Jonathan Terhorst, Sanjay Krishnan, Thomas Hofmann, and Michael I Jordan · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik Kingma and Jimmy Ba · 2014
Cited alongside, same era.
Stochastic proximal gradient descent with acceleration techniques
Atsushi Nitanda · 2014
Adding vs. averaging in distributed primal-dual optimization
Chenxin Ma, Virginia Smith, Martin Jaggi, Michael Jordan, Peter Richtarik, and Martin Takac · 2015
Later among the works it cites.
Adaptive restart for accelerated gradient schemes
Brendan O’donoghue and Emmanuel Candes · 2015
Later among the works it cites.
Even faster accelerated coordinate descent using non-uniform sampling
Zeyuan Allen-Zhu, Zheng Qu, Peter Richtarik, and Yang Yuan · 2016
Later among the works it cites.
Inexact coordinate descent: Complexity and preconditioning
R. Tappenden, P. Richtárik, and J. Gondzio · 2016
Later among the works it cites.
Inexact coordinate descent: Complexity and preconditioning
Rachael Tappenden, Peter Richtárik, and Jacek Gondzio · 2016
Later among the works it cites.
Geometric descent method for convex composite minimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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 geometric alternative to Nesterov’s accelerated gradient descent
Sébastien Bubeck, Yin Tat Lee, and Mohit Singh · 2015
Cited alongside, same era.
Accelerated, parallel, and proximal coordinate descent
Olivier Fercoq 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.
On the complexity analysis of randomized block-coordinate descent methods
Zhaosong Lu and Lin Xiao · 2015
Cited alongside, same era.
Shixiang Chen, Shiqian Ma, and Wei Liu · 2017
Closest in time.
Chenxin Ma, Martin Jaggi, Frank E. Curtis, Nathan Srebro, and Martin Takáč · 2017
Closest in time.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Closest in time.
An optimal first order method based on optimal quadratic averaging
Dmitriy Drusvyatskiy, Maryam Fazel, and Scott Roy · 2018
Closest in time.
A flexible coordinate descent method
Kimon Fountoulakis and Rachael Tappenden · 2018
Closest in time.
The approximate duality gap technique: A unified theory of first-order methods
Jelena Diakonikolas and Lorenzo Orecchia · 2019
Closest in time.