Abstract
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 which typical errors decay like N−δ with δ∈(0,12) and the critical regime in which errors decay of order N−1∕2logN in the runtime N of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
