Fetching the paper…
Reading the bibliography…
We propose and analyze a variant of the classic Polyak-Ruppert averaging scheme, broadly used in stochastic gradient methods.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
Efficient estimations from a slowly convergent robbins–monro process
David Ruppert · 1988
Earlier work this paper cites.
Equivalence of regularization and truncated iteration in the solution of ill-posed image reconstruction problems
Henry E. Fleming · 1990
Earlier work this paper cites.
New stochastic approximation type procedures
Boris Polyak · 1990
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
Boris T. Polyak and Anatoli B. Juditsky · 1992
Earlier work this paper cites.
On the averaged stochastic approximation for linear regression
László Györfi and Harro Walk · 1996
Earlier work this paper cites.
Reinforcement learning: An introduction , volume 1
Richard S Sutton and Andrew G Barto · 1998
Earlier work this paper cites.
Relative loss bounds for on-line density estimation with the exponential family of distributions
Katy S. Azoury and Manfred K. Warmuth · 2001
Earlier work this paper cites.
The elements of statistical learning , volume 1
Jerome Friedman, Trevor Hastie, and Robert Tibshirani · 2001
Earlier work this paper cites.
Competitive on-line statistics
Vladimir Vovk · 2001
Earlier work this paper cites.
Stochastic approximation and recursive algorithms and applications , volume 35
Harold Kushner and G George Yin · 2003
Earlier work this paper cites.
Model selection for regularized least-squares algorithm in learning theory
Ernesto De Vito, Andrea Caponnetto, and Lorenzo Rosasco · 2005
Cited alongside, same era.
Online learning algorithms
Steve Smale and Yuan Yao · 2006
Cited alongside, same era.
Optimal rates for the regularized least-squares algorithm
Andrea Caponnetto and Ernesto De Vito · 2007
Cited alongside, same era.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Cited alongside, same era.
On early stopping in gradient descent learning
Yuan Yao, Lorenzo Rosasco, and Andrea Caponnetto · 2007
Cited alongside, same era.
Introduction to Nonparametric Estimation
Alexandre B. Tsybakov · 2008
Cited alongside, same era.
Non-strongly-convex smooth stochastic approximation with convergence rate O ( 1 / n ) O(1/n)
Francis Bach and Eric Moulines · 2013
Later among the works it cites.
Online learning as stochastic approximation of regularization paths: Optimality and almost-sure convergence
Pierre Tarres and Yuan Yao · 2014
Later among the works it cites.
Constant step size least-mean-square: Bias-variance trade-offs and optimal sampling distributions
Alexandre Défossez and Francis Bach · 2015
Later among the works it cites.
Learning with incremental iterative regularization
Lorenzo Rosasco and Silvia Villa · 2015
Later among the works it cites.
Introduction to online convex optimization
Elad Hazan · 2016
Later among the works it cites.
Parallelizing stochastic approximation through mini-batching and tail-averaging
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yiming Ying and Massimiliano Pontil · 2008
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Cited alongside, same era.
Algorithms for reinforcement learning
Csaba Szepesvári · 2010
Cited alongside, same era.
Regularization in reinforcement learning
Amir-massoud Farahmand · 2011
Cited alongside, same era.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2012
Cited alongside, same era.
Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, and Aaron Sidford · 2016
Later among the works it cites.
Harder, better, faster, stronger convergence rates for least-squares regression
Aymeric Dieuleveut, Nicolas Flammarion, and Francis Bach · 2017
Later among the works it cites.
Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Venkata Krishna Pillutla, and Aaron Sidford · 2017
Later among the works it cites.
Optimal rates for multi-pass stochastic gradient methods
Junhong Lin and Lorenzo Rosasco · 2017
Later among the works it cites.
Linear stochastic approximation: Constant step-size and iterate averaging
Chandrashekar Lakshminarayanan and Csaba Szepesvári · 2018
Closest in time.