Segment 30. Expectation Maximization (EM) Methods

From Computational Statistics Course Wiki
Jump to navigation Jump to search

Watch this segment

(Don't worry, what you see statically below is not the beginning of the segment. Press the play button to start at the beginning.)

{{#widget:Iframe |url=http://www.youtube.com/v/StQOzRqTNsw&hd=1 |width=800 |height=625 |border=0 }}

The direct YouTube link is http://youtu.be/StQOzRqTNsw

Links to the slides: PDF file or PowerPoint file

Problems

To Calculate

1. For a set of positive values , 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 for all , for some two functions and . Prove that, at any local maximum of , one of these two conditions must hold: (1) [in which case the E-M algorithm has not yet terminated], or (2) is a local maximum of [in which case the E-M algorithm terminates at a maximum of , as advertised]. You can make any reasonable assumption about continuity of the functions.

To Think About

1. Jensen's inequality says something like "any concave function of a mixture of things is greater than the same mixture of the individual concave functions". What "mixture of things" is this idea being applied to in the proof of the E-M theorem (slide 4)?

2. So slide 4 proves that some function is less than the actual function of interest, namely . What makes this such a powerful idea?

Activity

The class activity for Friday can be found at EM activity.