10-601 GM2

From Cohen Courses
Revision as of 16:21, 22 March 2016 by Wcohen (talk | contribs) (→‎Slides)
Jump to navigationJump to search

Slides

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