The Annals of Statistics
- Ann. Statist.
- Volume 27, Number 1 (1999), 94-128.
Convergence of a stochastic approximation version of the EM algorithm
The expectation-maximization (EM) algorithm is a powerful computational technique for locating maxima of functions. It is widely used in statistics for maximum likelihood or maximum a posteriori estimation in incomplete data models. In certain situations, however, this method is not applicable because the expectation step cannot be performed in closed form. To deal with these problems, a novel method is introduced, the stochastic approximation EM (SAEM), which replaces the expectation step of the EM algorithm by one iteration of a stochastic approximation procedure. The convergence of the SAEM algorithm is established under conditions that are applicable to many practical situations. Moreover, it is proved that, under mild additional conditions, the attractive stationary points of the SAEM algorithm correspond to the local maxima of the function presented to support our findings.
Ann. Statist., Volume 27, Number 1 (1999), 94-128.
First available in Project Euclid: 5 April 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Delyon, Bernard; Lavielle, Marc; Moulines, Eric. Convergence of a stochastic approximation version of the EM algorithm. Ann. Statist. 27 (1999), no. 1, 94--128. doi:10.1214/aos/1018031103. https://projecteuclid.org/euclid.aos/1018031103