A review of Monte Carlo-based versions of the EM algorithm
Not on the map. Why?
Abstract (arXiv)
The EM algorithm is a powerful tool for maximum likelihood estimation with missing data. In practice, the calculations required for the EM algorithm are often intractable. We review numerous methods to circumvent this intractability, all of which are based on Monte Carlo simulation. We focus our attention on the Monte Carlo EM (MCEM) algorithm and its various implementations. We also discuss some related methods like stochastic approximation and Monte Carlo maximum likelihood. Generating the Monte Carlo samples necessary for these methods is, in general, a hard problem. As such, we review several simulation strategies which can be used to address this challenge. Given the wide range of methods available for approximating the EM, it can be challenging to select which one to use. We review numerous comparisons between these methods from a wide range of sources, and offer guidance on synthesizing the findings. Finally, we give some directions for future research to fill important gaps in the existing literature on the MCEM algorithm and related methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Jan 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2024Learning Diffusion Priors from Observations by Expectation Maximizationcited by 60
- 2024MCMC-driven learningcited by 0
- 2025MMM: Clustering Multivariate Longitudinal Mixed-type Datacited by 0
- 2025AutoGD: Automatic Learning Rate Selection for Gradient Descentcited by 0
- 2025AutoGD: Automatic Learning Rate Selection for Gradient Descent10 Oct 2025
- 2025MMM: Clustering Multivariate Longitudinal Mixed-type Data15 Sep 2025
- 2024Learning Diffusion Priors from Observations by Expectation Maximization22 May 2024
- 2024MCMC-driven learning14 Feb 2024