Fetching the paper…
Reading the bibliography…
We consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on the minimization of the empirical risk.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovsky and D. B. Yudin · 1983
Earlier work this paper cites.
Analysis of the normalized lms algorithm with gaussian inputs
N.J. Bershad · 1986
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
B. T. Polyak and A. B. Juditsky · 1992
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Y. Nesterov and A. Nemirovskii · 1994
Earlier work this paper cites.
Optimum bounds for the distributions of martingales in banach spaces
I. Pinelis · 1994
Earlier work this paper cites.
Adaptive processing: The least mean squares approach with applications in transmission
O. Macchi · 1995
Earlier work this paper cites.
A fast fixed-point algorithm for independent component analysis
A. Hyvärinen and E. Oja · 1997
Earlier work this paper cites.
Stochastic approximation with two time scales
V. S. Borkar · 1997
Earlier work this paper cites.
On a perturbation approach for the analysis of stochastic tracking algorithms
R. Aguech, E. Moulines, and P. Priouret · 2000
Earlier work this paper cites.
Convergence rate of incremental subgradient algorithms
A. Nedic and D. Bertsekas · 2000
Cited alongside, same era.
Asymptotic statistics
A. W. Van der Vaart · 2000
Cited alongside, same era.
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
E. Hazan and S. Kale · 2001
Cited alongside, same era.
Smoothing spline ANOVA models
C. Gu · 2002
Cited alongside, same era.
Stochastic approximation and recursive algorithms and applications
H. J. Kushner and G. G. Yin · 2003
Cited alongside, same era.
Optimal rates of aggregation
A. B. Tsybakov · 2003
Cited alongside, same era.
Convex Optimization
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Later among the works it cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
A. Agarwal, P. L. Bartlett, P. Ravikumar, and M. J. Wainwright · 2009
Later among the works it cites.
Markov Chains and Stochastic Stability
S. P. Meyn and R. L. Tweedie · 2009
Later among the works it cites.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2010
Later among the works it cites.
Self-concordant analysis for logistic regression
F. Bach · 2010
Later among the works it cites.
Non-asymptotic analysis of stochastic approximation algorithms for machine learning
F. Bach and E. Moulines · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Boyd and L. Vandenberghe · 2003
Cited alongside, same era.
Introductory lectures on convex optimization: a basic course
Y. Nesterov · 2004
Cited alongside, same era.
Pegasos: Primal estimated sub-gradient solver for svm
S. Shalev-Shwartz, Y. Singer, and N. Srebro · 2007
Cited alongside, same era.
The tradeoffs of large scale learning
L. Bottou and O. Bousquet · 2008
Cited alongside, same era.
An optimal method for stochastic composite optimization
G. Lan · 2012
Later among the works it cites.
A stochastic gradient method with an exponential convergence rate for strongly-convex optimization with finite training sets
N. Le Roux, M. Schmidt, and F. Bach · 2012
Later among the works it cites.
Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
F. Bach · 2013
Closest in time.