Answers are grounded in this paper and cite their sources.
We obtain non asymptotic concentration bounds for two kinds of stochastic approximations. We first consider the deviations between the expectation of a given function of an Euler like discretization scheme of some diffusion process at a fixed deterministic time and its empirical mean obtained by the Monte Carlo procedure. We then give some estimates concerning the deviation between the value at a given time-step of a stochastic approximation algorithm and its target. Under suitable assumptions both concentration bounds turn out to be Gaussian. The key tool consists in exploiting accurately the concentration properties of the increments of the schemes. Also, no specific non-degeneracy conditions are assumed. An Erratum is available in ECP volume 17 paper number 60.
No takes yet. Share an insight, caveat, or question.
Frikha et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: