Fetching the paper…
Reading the bibliography…
We design and analyze an algorithm for first-order stochastic optimization of a large class of functions on $\mathbb{R}^d$.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Pseudogradient adaptation and training algorithms
B. Polyak and Y.Z. Tsypkin · 1973
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovsky and D. Yudin · 1983
Earlier work this paper cites.
A probability path
S. I. Resnick · 1999
Earlier work this paper cites.
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2002
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course , volume 87
Y. Nesterov · 2004
Earlier work this paper cites.
Solving large scale linear prediction problems using stochastic gradient descent algorithms
T. Zhang · 2004
Earlier work this paper cites.
Online learning meets optimization in the dual
S. Shalev-Shwartz and Y. Singer · 2006
Earlier work this paper cites.
Online Learning: Theory, Algorithms, and Applications
S. Shalev-Shwartz · 2007
Earlier work this paper cites.
Convex repeated games and Fenchel duality
S. Shalev-Shwartz and Y. Singer · 2007
Earlier work this paper cites.
Competing in the dark: An efficient algorithm for bandit linear optimization
J. D. Abernethy, E. Hazan, and A. Rakhlin · 2008
Earlier work this paper cites.
Inequalities on the Lambert W function and hyperpower function
A. Hoorfar and M. Hassani · 2008
Earlier work this paper cites.
A parameter-free hedging algorithm
K. Chaudhuri, Y. Freund, and D. J. Hsu · 2009
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Cited alongside, same era.
Prediction with advice of unknown number of experts
A. Chernov and V. Vovk · 2010
Cited alongside, same era.
Robust selective sampling from single and multiple teachers
O. Dekel, C. Gentile, and K. Sridharan · 2010
Cited alongside, same era.
No-regret algorithms for unconstrained online convex optimization
M. Streeter and B. McMahan · 2012
Cited alongside, same era.
Minimax optimal algorithms for unconstrained linear optimization
B. McMahan and J. Abernethy · 2013
Cited alongside, same era.
Dimension-free exponentiated gradient
F. Orabona · 2013
Cited alongside, same era.
A modular analysis of adaptive (non-)convex optimization: Optimism, composite objectives, and variational bounds
P. Joulani, A. György, and C. Szepesvári · 2017
Later among the works it cites.
Stochastic mirror descent in variationally coherent optimization problems
Z. Zhou, P. Mertikopoulos, N. Bambos, S. Boyd, and P. W. Glynn · 2017
Later among the works it cites.
Online algorithms and stochastic approximations
L. Bottou · 2018
Later among the works it cites.
Optimization methods for large-scale machine learning
L. Bottou, F. E. Curtis, and J. Nocedal · 2018
Later among the works it cites.
Black-box reductions for parameter-free online learning in Banach spaces
A. Cutkosky and F. Orabona · 2018
Later among the works it cites.
Artificial constraints and hints for unbounded online learning
A. Cutkosky · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
O. Shamir and T. Zhang · 2013
Cited alongside, same era.
Unconstrained online linear learning in Hilbert spaces: Minimax algorithms and normal approximations
H. B. McMahan and F. Orabona · 2014
Cited alongside, same era.
Simultaneous model selection and optimization through parameter-free stochastic learning
F. Orabona · 2014
Cited alongside, same era.
Second-order quantile methods for experts and combinatorial games
W. M. Koolen and T. van Erven · 2015
Cited alongside, same era.
Achieving all with no parameters: AdaNormalHedge
H. Luo and R. E. Schapire · 2015
Cited alongside, same era.
Coin betting and parameter-free online learning
F. Orabona and D. Pál · 2016
Cited alongside, same era.
Later among the works it cites.
On the convergence of stochastic gradient descent with adaptive stepsizes
X. Li and F. Orabona · 2019
Later among the works it cites.
A modern introduction to online learning
F. Orabona · 2019
Later among the works it cites.
Online mirror descent and dual averaging: keeping pace in the dynamic case
H. Fang, N. Harvey, V. Portella, and M. Friedlander · 2020
Later among the works it cites.
Unifying mirror descent and dual averaging
A. Juditsky, J. Kwon, and É. Moulines · 2020
Later among the works it cites.
Last iterate of SGD converges (even in unbounded domains), 2020
F. Orabona · 2020
Later among the works it cites.
On the convergence of mirror descent beyond stochastic convex programming
Z. Zhou, P. Mertikopoulos, N. Bambos, S. P. Boyd, and P. W. Glynn · 2020
Later among the works it cites.