You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On the Convergence Properties of the EM Algorithm
C. F. Jeff Wu
The Annals of Statistics
Vol. 11, No. 1 (Mar., 1983), pp. 95-103
Published by: Institute of Mathematical Statistics
Stable URL: http://www.jstor.org/stable/2240463
Page Count: 9
You can always find the topics here!Topics: Local maximum, Algorithms, Statism, Maximum likelihood estimation, Statistical theories, Perceptron convergence procedure, Statistics, Saddle points, Sufficient conditions, Observational research
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Two convergence aspects of the EM algorithm are studied: (i) does the EM algorithm find a local maximum or a stationary value of the (incomplete-data) likelihood function? (ii) does the sequence of parameter estimates generated by EM converge? Several convergence results are obtained under conditions that are applicable to many practical situations. Two useful special cases are: (a) if the unobserved complete-data specification can be described by a curved exponential family with compact parameter space, all the limit points of any EM sequence are stationary points of the likelihood function; (b) if the likelihood function is unimodal and a certain differentiability condition is satisfied, then any EM sequence converges to the unique maximum likelihood estimate. A list of key properties of the algorithm is included.
The Annals of Statistics © 1983 Institute of Mathematical Statistics