10-601 GM2
From Cohen Courses
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