Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions

Most machine learning methods can be regarded as the minimization of an unavailable risk function. To optimize the latter, with samples provided in a streaming fashion, we define general (weighted averaged) stochastic Newton algorithms, for which a theoretical analysis of their asymptotic efficiency is conducted. The corresponding implementations are shown not to require the inversion of a Hessian estimate at each iteration under a quite flexible framework that covers the case of linear, logistic or softmax regressions to name a few. Numerical experiments on simulated and real data give the empirical evidence of the pertinence of the proposed methods, which outperform popular competitors particularly in case of bad initializations.