Convergence of a stochastic approximation version of the EM algorithm
Open Access
- 1 March 1999
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 27 (1), 94-128
- https://doi.org/10.1214/aos/1018031103
Abstract
In the previous article, we studied notions such as algorithmic universality, computability, and incomputability. In this article, we study the notion of correctness of programs, illustrate a method of establishing the correctness of programs and discuss issues in the development of correct software.Keywords
This publication has 29 references indexed in Scilit:
- Convergence of stochastic algorithms: from the Kushner–Clark theorem to the Lyapounov functional methodAdvances in Applied Probability, 1996
- General results on the convergence of stochastic algorithmsIEEE Transactions on Automatic Control, 1996
- On the Rate of Convergence of the ECM AlgorithmThe Annals of Statistics, 1994
- Partial non-Gaussian state spaceBiometrika, 1994
- Asymptotic properties of a stochastic EM Algorithm for estimating mixing proportionsCommunications in Statistics. Stochastic Models, 1993
- Maximum likelihood estimation via the ECM algorithm: A general frameworkBiometrika, 1993
- A stochastic approximation type EM algorithm for the mixture problemStochastics and Stochastic Reports, 1992
- Stochastic optimization with averaging of trajectoriesStochastics and Stochastic Reports, 1992
- A Monte Carlo Implementation of the EM Algorithm and the Poor Man's Data Augmentation AlgorithmsJournal of the American Statistical Association, 1990
- On the Convergence Properties of the EM AlgorithmThe Annals of Statistics, 1983