Open Access
August, 1968 On Asymptotic Normality in Stochastic Approximation
Vaclav Fabian
Ann. Math. Statist. 39(4): 1327-1332 (August, 1968). DOI: 10.1214/aoms/1177698258


A new method, simpler than previous methods due to Chung (1954) and Sacks (1958), is used to prove Theorem 2.2 below, which implies in a simple way all known results on asymptotic normality in various cases of stochastic approximation. Two examples of application are concerned with Venter's (1967) extension of the RM method and Fabian's (1967) modification of the KW process. Previously, although there was no difficulty in adopting one or the other method, the proofs in various cases had to be done almost ab initio or skipped leaving a gap (see Venter (1967)). The new proof is similar to that of Chung except that the basic recurrence relation is used to obtain the asymptotic characteristic function rather than limits of all moments. We remark that Lemma 2.1, a simple corollary to Chung's lemma is used only to obtain condition (2.2.4) which is weaker than (2.2.3) if $\alpha = 1$ and which corresponds to the usual Lindeberg condition. Both conditions (2.2.3) and (2.2.4) are weaker than the corresponding condition (3.4) in Sacks (1958). In what follows $(\Omega, \mathscr{S}, P)$ will be a probability space, relations between and convergence of random variables, vectors, and matrices will be meant with probability one unless specified otherwise. We shall write $X_n \sim \mathscr{L}$ if $X_n$ is asymptotically $\mathscr{L}$-distributed and $X_n \sim Y_n$, for two sequences of random vectors, if for any $\mathscr{L}, X_n \sim \mathscr{L}$ if and only if $Y_n \sim \mathscr{L}$. The indicator function of a set $A$ will be denoted by $\chi A$, the expectation and conditional expectation by $E$ and $E_F$, respectively. $R^k$ is the $k$-dimensional Euclidean space the elements of which are considered to be column vectors, $R = R^1, R^{k\times k}$ is the space of all real $k \times k$ matrices. The symbols $\mathbf{R}, \mathbf{R}^k, \mathbf{R}^{k\times k}$, denote sets of all measurable transformations from $(\Omega, \mathscr{S})$ to $R, R^k R^{k\times k}$, respectively. The unit matrix in $R^{k\times k}$ is denoted by $I$ and $| |$ is the Euclidean norm. With $h_n$ a sequence of numbers, $o(h_n), O(h_n), o_u(h_n), O_u(h_n)$ denote sequences $g_n, G_n, q_n, Q_n$, say, of elements in one of the sets $\mathbf{R}, \mathbf{R}^k, \mathbf{R}^{k\times k}$ such that $h_n^{-1} g_n \rightarrow 0, | h_n^{-1} G_n|\leqq f$ for an $f \varepsilon \mathbf{R}$ and all $n, h_n^{-1} q_n \rightarrow O$ uniformly on a set of probability one, $| h_n^{-1} Q_n| \leqq K$ for a $K \varepsilon R$ and all $n$. In special cases $o(h_n)$ may be constant on $\Omega$ and considered as a sequence with elements in $R, R^k$ or $R^{k\times k}$. Similarly in other cases. For Chung's lemma, which will be frequently referred to, or used later without reference, see Fabian ((1967), Lemma 4.2); note that it holds with $\beta = 0$, too.


Download Citation

Vaclav Fabian. "On Asymptotic Normality in Stochastic Approximation." Ann. Math. Statist. 39 (4) 1327 - 1332, August, 1968.


Published: August, 1968
First available in Project Euclid: 27 April 2007

zbMATH: 0176.48402
MathSciNet: MR231429
Digital Object Identifier: 10.1214/aoms/1177698258

Rights: Copyright © 1968 Institute of Mathematical Statistics

Vol.39 • No. 4 • August, 1968
Back to Top