First, we de ne 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, also gives asymptotically almost surely efficient algorithms. Moreover, we prove that the averaged algorithm also satis es a law of the iterated logarithm, a well as an almost sure central limit theorem.