## Abstract A general almost sure limit theorem is presented for random fields. It is applied to obtain almost sure versions of some (functional) central limit theorems. (Β© 2003 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
An Almost Sure Central Limit Theorem for Stochastic Approximation Algorithms
β Scribed by Mariane Pelletier
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 154 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
β¦ Synopsis
We prove an almost sure central limit theorem for some multidimensional stochastic algorithms used for the search of zeros of a function and known to satisfy a central limit theorem. The almost sure version of the central limit theorem requires either a logarithmic empirical mean (in the same way as in the case of independent identically distributed variables) or another scale, depending on the choice of the algorithm gains.
π SIMILAR VOLUMES
## Abstract Let __X__, __X__~1~, __X__~2~, β¦ be i.i.d. random variables with nondegenerate common distribution function __F__, satisfying __EX__ = 0, __EX__^2^ = 1. Let __X~i~__ and __M~n~__ = max{__X~i~__, 1 β€ __i__ β€ __n__ }. Suppose there exists constants __a~n~__ > 0, __b~n~__ β __R__ and a non
## Abstract Let {__S~n~__, __n__ β₯ 1} be partial sums of independent identically distributed random variables. The almost sure version of CLT is generalized on the case of randomly indexed sums {__S~Nn~__, __n__ β₯ 1}, where {__N~n~__, __n__ β₯ 1} is a sequence of positive integerβvalued random varia