General multilevel adaptations for stochastic approximation algorithms

In this article we establish central limit theorems for multilevel Polyak-Ruppert averaged stochastic approximation schemes. We work under very mild technical assumptions and consider the slow regime in wich typical errors decay like $N^{-\delta}$ with $\delta\in(0,\frac 12)$ and the critical regime in which errors decay of order $N^{-1/2}\sqrt{\log N}$ in the runtime $N$ of the algorithm.