On the simulation size and the convergence of the Monte Carlo EM algorithm via likelihood-based distances
When the conditional expectation of a complete-data likelihood in an EM algorithm is analytically intractable, Monte Carlo integration is often used to approximate the E-step. While the resulting Monte Carlo EM algorithm (MCEM) is flexible, assessing convergence of the algorithm is a more difficult task than the original EM algorithm, because of the uncertainty involved in the Monte Carlo approximation. In this note, we propose a convergence criterion using a likelihood-based distance. Because the likelihood is approximated by Monte Carlo integration, we make the distance small with a large probability by selecting the Monte Carlo sample size adaptively at each step of the MCEM algorithm. We implement the proposed convergence criterion along with the simulation size selection in a one-way random effects model. The result shows that our MCEM iterations match the exact EM iterations closely.
Year of publication: |
2004
|
---|---|
Authors: | Eickhoff, Jens C. ; Zhu, Jun ; Amemiya, Yasuo |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 67.2004, 2, p. 161-171
|
Publisher: |
Elsevier |
Keywords: | Goodness of fit Likelihood ratio test MCEM |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Zhu, Jun, (2003)
-
Haaland, Ben, (2010)
-
Dynamic latent class model averaging for online prediction
Yang, Hongxia, (2015)
- More ...