Mariane Pelletier, “Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms”, SIAM J. Control Optim., 39, № 1, 2000, 49
Peggy Cénac, “On the convergence of moments in the almost sure central limit theorem for stochastic approximation algorithms”, ESAIM: PS, 17, 2013, 179
N. Lazrieva, T. Toronjadze, “The Robbins-Monro type stochastic differential equations. III. Polyak's averaging”, Stochastics, 82, № 2, 2010, 165
Mariane Pelletier, “On the almost sure asymptotic behaviour of stochastic algorithms”, Stochastic Processes and their Applications, 78, № 2, 1998, 217
Arnulf Jentzen, Benno Kuckuck, Ariel Neufeld, Philippe von Wurstemberger, “Strong error analysis for stochastic gradient descent optimization algorithms”, IMA Journal of Numerical Analysis, 41, № 1, 2021, 455
A. Mokkadem, M. Pelletier, “The multivariate Révész’s online estimator of a regression function and its averaging”, Math. Meth. Stat., 25, № 3, 2016, 151
Abdelkader Mokkadem, Mariane Pelletier, “A companion for the Kiefer–Wolfowitz–Blum stochastic approximation algorithm”, Ann. Statist., 35, № 4, 2007