Asymptotic almost sure efficiency of averaged stochastic algorithms

We first define the notion of almost sure efficiency for a decreasing stepsize stochastic algorithm, and then, we show that the averaging method, which gives asymptotically efficient algorithms, gives asymptotically almost surely efficient algorithms too. We also show that the averaged algorithm satisfies an almost sure central limit theorem, as well as a result similar to the law of the iterated logarithm.