Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2009/iii/paper-40/6/d/solution
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 40 6 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Both EM algorithm and data augmentation exploit a latent completion , but they use it differently. EM takes a conditional expectation of the complete-data log-likelihood and then maximizes over the parameter, producing a deterministic sequence of point estimates when the M-step is uniquely specified.
In Bayesian data augmentation, choose a prior distribution and targetAlternate the Gibbs sampler updatesThese are stochastic draws from full conditional distributions, not an expectation followed by maximization. Their invariant law is the augmented joint posterior, and discarding gives posterior inference for , including uncertainty rather than only an MLE. A sampled completion followed by maximization would instead be a stochastic EM variant. Individual likelihood values along a data-augmentation chain need not increase: the chain is designed to sample a posterior, not to ascend the likelihood.
New to topics? Read the docs here!