Triple jump acceleration for the EM algorithm and its extrapolation-based variants

author: Han-Shen Huang, Institute of Information Science, Academia Sinica
published: Feb. 25, 2007,   recorded: July 2006,   views: 3694

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

The Aitken's acceleration is one of the most commonly used method to speed up the fixed-point iteration computation, including the EM algorithm. However, it requires to compute or approximate the Jacobian of the EM mapping matrix, which can be intractable for complex models. We will present our current research topic, the triple-jump acceleration, to accelerate the EM and some of its extrapolation-based variants by approximating their Jacobians. One advantage of the triple jump framework is that we can directly use the EM and its extrapolation-based variants as black boxes and achieve acceleration easily. We can update parameter vectors globally with the same approximated Jacobian, or locally based on each decomposable component with different Jacobians. Experimental results show that the triple jump methods consistently accelerate EM, parameterized EM (pEM) and adaptive EM (aEM) for a variety of probabilistic models.

See Also:

Download slides icon Download slides: mlss06tw_huang_tjaai.pdf (779.9┬áKB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: