Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2008/iii/paper-47/6/b/iii/solution

Initialize . At each iteration first compute by the conditional expectation above. The M-step applies the complete-data maximum-likelihood estimator to the filled counts, giving
Repeat until convergence. If all counts are zero, the likelihood function is constant and any parameter can be retained. For a nonempty sample an interior start makes the displayed denominator positive.
Here the three observed cell probabilities are , and , so the observed log-likelihood is
For a nonempty sample its second derivative on is
Thus the maximum-likelihood estimator is unique, allowing a boundary maximum. To verify that the iteration actually finds it, let and . Then , and
If the maximum is interior, this identity moves each iterate towards it, and monotonicity of prevents crossing it. The bounded monotone iterates converge; continuity makes their limit a fixed point, and strict concavity makes that fixed point the maximum. If the maximum is at zero or one, the sign of gives the same monotone convergence towards the appropriate endpoint. In the special case , is identically one whenever its denominator is positive, so the maximum is reached in one step. An interior initialization avoids the possible spurious zero fixed point when ; starting at zero can otherwise trap the iteration even when the true maximum is positive.

New to topics? Read the docs here!