Implementations of the Monte Carlo EM Algorithm

The Monte Carlo EM (MCEM) algorithm is a modification of the EM algorithm where the expectation in the E-step is computed numerically through Monte Carlo simulations. The most exible and generally applicable approach to obtaining a Monte Carlo sample in each iteration of an MCEM algorithm is through Markov chain Monte Carlo (MCMC) routines such as the Gibbs and Metropolis–Hastings samplers. Although MCMC estimation presents a tractable solution to problems where the E-step is not available in closed form, two issues arise when implementing this MCEM routine: (1) how do we minimize the computational cost in obtaining an MCMC sample? and (2) how do we choose the Monte Carlo sample size? We address the first question through an application of importance sampling whereby samples drawn during previous EM iterations are recycled rather than running an MCMC sampler each MCEM iteration. The second question is addressed through an application of regenerative simulation. We obtain approximate independent and identical samples by subsampling the generated MCMC sample during different renewal periods. Standard central limit theorems may thus be used to gauge Monte Carlo error. In particular, we apply an automated rule for increasing the Monte Carlo sample size when the Monte Carlo error overwhelms the EM estimate at any given iteration. We illustrate our MCEM algorithm through analyses of two datasets fit by generalized linear mixed models. As a part of these applications, we demonstrate the improvement in computational cost and efficiency of our routine over alternative MCEM strategies.

[1]  New York Dover,et al.  ON THE CONVERGENCE PROPERTIES OF THE EM ALGORITHM , 1983 .

[2]  S. Varadhan,et al.  Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions , 1986 .

[3]  G. C. Wei,et al.  A Monte Carlo Implementation of the EM Algorithm and the Poor Man's Data Augmentation Algorithms , 1990 .

[4]  D. Duffy,et al.  Appendectomy in Australian twins. , 1990, American journal of human genetics.

[5]  Charles J. Geyer,et al.  Reweighting Monte Carlo Mixtures , 1991 .

[6]  Andrew L. Rukhin,et al.  Tools for statistical inference , 1991 .

[7]  Charles J. Geyer,et al.  Practical Markov Chain Monte Carlo , 1992 .

[8]  J. H. Schuenemeyer,et al.  Generalized Linear Models (2nd ed.) , 1992 .

[9]  S. Chib,et al.  Bayesian analysis of binary and polychotomous response data , 1993 .

[10]  C. Geyer,et al.  Discussion: Markov Chains for Exploring Posterior Distributions , 1994 .

[11]  L. Tierney.  Markov Chains for Exploring Posterior Distributions , 1994 .

[12]  Hani Doss.  Discussion: Markov Chains for Exploring Posterior Distributions , 1994 .

[13]  C. McCulloch.  Maximum Likelihood Variance Components Estimation for Binary Data , 1994 .

[14]  L. Tierney.  Rejoinder: Markov Chains for Exploring Posterior Distributions , 1994 .

[15]  C. Robert.  Discussion: Markov Chains for Exploring Posterior Distributions , 1994 .

[16]  C. Robert.  Simulation of truncated normal variables , 2009, 0907.4010.

[17]  Bin Yu,et al.  Regeneration in Markov chain samplers , 1995 .

[18]  K. Chan,et al.  Monte Carlo EM Estimation for Time Series Models Involving Counts , 1995 .

[19]  C. Robert.  Convergence Control Methods for Markov Chain Monte Carlo Algorithms , 1995 .

[20]  R. Tweedie,et al.  Rates of convergence of the Hastings and Metropolis algorithms , 1996 .

[21]  Jun S. Liu,et al.  Metropolized independent sampling with comparisons to rejection sampling and importance sampling , 1996, Stat. Comput..

[22]  A. Kuk,et al.  MAXIMUM LIKELIHOOD ESTIMATION FOR PROBIT-LINEAR MIXED MODELS WITH CORRELATED RANDOM EFFECTS , 1997 .

[23]  C. McCulloch.  Maximum Likelihood Algorithms for Generalized Linear Mixed Models , 1997 .

[24]  G. Casella,et al.  Post-Processing Accept-Reject Samples: Recycling and Rescaling , 1998 .

[25]  J. Booth,et al.  Maximizing generalized linear mixed model likelihoods with an automated Monte Carlo EM algorithm , 1999 .

[26]  C. Robert,et al.  Convergence Controls for MCMC Algorithms with Applications to Hidden Markov Chains , 1999 .

[27]  D. V. Dyk.  NESTING EM ALGORITHMS FOR COMPUTATIONAL EFFICIENCY , 2000 .

[28]  Richard A. Levine,et al.  Multicomponent lifetime distributions in the presence of ageing , 2000 .