10-601 GM2

This a lecture used in the Syllabus for Machine Learning 10-601B in Spring 2016

Slides

• Slides in PPT, Slides in PDF.

Readings

• See previous lecture

To remember

• what is inference in DGMs
• the general outline of the BP algorithm for polytrees
• what is a polytree and when is BP exact
  • what "message passing" means
• what a Markov blanket is
• what a Markov network (undirected model) is
• how node can be merged to create a polytree
• the advantages and disadvantages of BP on polytrees and loopy BP