# Difference between revisions of "Eleisha's Segment 30: Expectation Maximization (EM) Methods"

To Calculate 1. For a set of positive values $\displaystyle \{x_i\}$ , use Jensen's inequality to show (a) the mean of their square is never less than the square of their mean, and (b) their (arithmetic) mean is never less than their harmonic mean.
2. Sharpen the argument about termination of E-M methods that was given in slide 4, as follows: Suppose that $\displaystyle g(x) \ge f(x)$ for all x, for some two functions $\displaystyle f$ and $\displaystyle g$ . Prove that, at any local maximum $\displaystyle x_m$ of $\displaystyle f$ , one of these two conditions must hold: (1) $\displaystyle g(x_m) > f(x_m)$ [in which case the E-M algorithm has not yet terminated], or (2) $\displaystyle g(x_m)$ is a local maximum of $\displaystyle g$ [in which case the E-M algorithm terminates at a maximum of g, as advertised]. You can make any reasonable assumption about continuity of the functions.
2. So slide 4 proves that some function is less than the actual function of interest, namely $\displaystyle L(\theta)$ . What makes this such a powerful idea?