• A
• A
• A
• ABC
• ABC
• ABC
• А
• А
• А
• А
• А
Regular version of the site

A Local Limit Theorem for Robbins-Monro Procedure

math. arxive. Cornell University, 2018. No. 1810.09678.
Huang L., Konakov V.
The Robbins-Monro algorithm is a recursive, simulation-based stochastic procedure to approximate the zeros of a function that can be written as an expectation. It is known that under some technical assumptions, a Gaussian convergence can be established for the procedure. Here, we are interested in the local limit theorem, that is, quantifying this convergence on the density of the involved objects. The analysis relies on a parametrix technique for Markov chains converging to diffusions, where the drift is unbounded.