10-601 GM2

From Cohen Courses
Revision as of 10:52, 31 March 2016 by Wcohen (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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

Slides

Readings

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
Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=10-601_GM2&oldid=18436"