Pith. sign in

REVIEW 1 cited by

A review of Monte Carlo-based versions of the EM algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.00945 v1 pith:YN4HQ6PG submitted 2024-01-01 stat.CO stat.ME

classification stat.COstat.ME
keywords methodsalgorithmmontecarloreviewlikelihoodmaximummcem
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Variational methods for Learning Multilevel Genetic Algorithms using the Kantorovich Monad

    q-bio.PE 2024-11 reject novelty 7.0 of 10

    Introduces a multilevel Wright-Fisher process built on the Kantorovich monad, derives a mixed Price equation, and fits multilevel genetic algorithms to synthetic data with variational and coalescent methods.

Pith tools