Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,

Similar presentations


Presentation on theme: "Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,"— Presentation transcript:

1 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring, 2006 Graphical Models Jeff A. Bilmes Lecture 15 Slides May 22 nd, 2006

2 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 2 READING: –M. Jordan: Chapters 13,14,15 (on Gaussians and Kalman) Reminder: TA discussions and office hours: –Office hours: Thursdays 3:30-4:30, Sieg Ground Floor Tutorial Center –Discussion Sections: Fridays 9:30-10:30, Sieg Ground Floor Tutorial Center Lecture Room No more homework this quarter, concentrate on final projects!! Makeup class, next Monday 5/22, 6:00-8:00pm. Room TBA Announcements

3 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 3 L1: Tues, 3/28: Overview, GMs, Intro BNs. L2: Thur, 3/30: semantics of BNs + UGMs L3: Tues, 4/4: elimination, probs, chordal I L4: Thur, 4/6: chrdal, sep, decomp, elim L5: Tue, 4/11: chdl/elim, mcs, triang, ci props. L6: Thur, 4/13: MST,CI axioms, Markov prps. L7: Tues, 4/18: Mobius, HC-thm, (F)=(G) L8: Thur, 4/20: phylogenetic trees, HMMs L9: Tue, 4/25: HMMs, inference on trees L10: Thur, 4/27: Inference on trees, start poly L11: Tues, 5/2: polytrees, start JT inference L12: Thur, 5/4: Inference in JTs Tues, 5/9: away Thur, 5/11: away L13: Tue, 5/16: JT, GDL, Shenoy-Schafer L14: Thur, 5/18: GDL, Search, Gaussians I L15: Mon, 5/22: L16: Tues, 5/23 L17: Thur, 5/25 Mon, 5/29: Holiday L18: Tue, 5/30 L19: Thur, 6/1: final presentations Class Road Map

4 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 4 L1: Tues, 3/28: L2: Thur, 3/30: L3: Tues, 4/4: L4: Thur, 4/6: L5: Tue, 4/11: L6: Thur, 4/13: L7: Tues, 4/18: L8: Thur, 4/20: Team Lists, short abstracts I L9: Tue, 4/25: L10: Thur, 4/27: short abstracts II L11: Tues, 5/2: L12: Thur, 5/4: abstract II + progress L--: Tues, 5/9 L--: Thur, 5/11: 1 page progress report L13: Tue, 5/16: L14: Thur, 5/18: 1 page progress report L15: Mon, 5/22: 6-8pm L16: Tues, 5/23 L17: Thur, 5/25: 1 page progress report L18: Tue, 5/30 L19: Thur, 6/1: final presentations L20: Tue, 6/6 4-page papers due (like a conference paper), Only.pdf versions accepted. Final Project Milestone Due Dates Team lists, abstracts, and progress reports must be turned in, in class and using paper (dead tree versions only). Final reports must be turned in electronically in PDF (no other formats accepted). No need to repeat what was on previous progress reports/abstracts, I have those available to refer to. Progress reports must report who did what so far!!

5 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 5 generalized distributive law and Shenoy-Shafer formulation other forms of exact probabilistic inference inference (cut- set conditioning, recursive conditioning, search and cache-based schemes, comparisons with SAT/CSP). Summary of Last Time

6 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 6 other forms of exact probabilistic inference inference (cut- set conditioning, recursive conditioning, search and cache-based schemes, comparisons with SAT/CSP). Gaussian Graphical Models Outline of Today’s Lecture

7 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 7 Books and Sources for Today M. Jordan: Chapters 4,10,12,17,18 Aji&McEliece, “The generalized distributive Law”, IEEE Trans. IT, 2000. Pearl’s 1988 book Adnan Darwiche’s papers on recursive conditioning various CSP/SAT sources Jordan chapters 13-15

8 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 8 Generalized Distributive Law

9 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 9 Commutative Semiring definition

10 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 10 Commutative Semiring definition

11 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 11 Commutative Semi-rings: Examples

12 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 12 Commutative Semi-rings: Examples

13 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 13 Example: Viterbi-Algorithm

14 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 14 Example: Bayesian networks Earthquake Radio Burglary Alarm Call

15 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 15 Other examples

16 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 16 Towards message passing MP

17 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 17 Towards message passing MP

18 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 18 Towards message passing MP

19 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 19 Message trellis

20 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 20 Message trellis

21 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 21 Message trellis

22 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 22 Complexities

23 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 23 3-SAT

24 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 24 3-SAT as factorization and BNs

25 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 25 3-SAT as factorization and BNs

26 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 26 3-SAT as a BN

27 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 27 Other ways of doing inference

28 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 28 cutset conditioning

29 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 29 cutset conditioning

30 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 30 time-space tradeoffs

31 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 31 time-space tradeoffs

32 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 32 recursive conditioning

33 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 33 naïve approach to recursive conditioning

34 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 34 recursive conditioning with good order

35 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 35 recursive conditioning

36 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 36 recursive conditioning with good order

37 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 37 recursive conditioning with good order

38 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 38 recursive conditioning with caching

39 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 39 value specific caching

40 Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 40 Idea of the value elimination algorithm


Download ppt "Lec 15: May 22nd, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,"

Similar presentations


Ads by Google