On the almost sure asymptotic behaviour of stochastic algorithms

We study the almost sure asymptotic behaviour of decreasing stepsized stochastic algorithms used for the search of zeros of a function. We prove a law of the iterated logarithm, which gives the almost sure convergence rate of the algorithm, and we establish a quadratic strong law of large numbers.