![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Monday 05 November 2007, 11:15-12:15
Loopy Belief Propagation
- đ¤ Speaker: Philip Sterne (University of Cambridge)
- đ Date & Time: Monday 05 November 2007, 11:15 - 12:15
- đ Venue: TCM Seminar Room, Cavendish Laboratory, Department of Physics
Questions? Contact
Philip Sterne
Abstract
This is a follow on to last week’s Belief Propagation. This week we will briefly recap the sum product algorithm and then look at hacking the algorithm for loopy graphs.
A good application of loopy belief propagation (Low Density Parity Check codes) is given in chapter 47 of ITILA
Series This talk is part of the Machine Learning Journal Club series.
Included in Lists
- Cambridge talks
- Guy Emerson's list
- Hanchen DaDaDash
- Inference Group Journal Clubs
- Inference Group Summary
- Interested Talks
- Machine Learning Journal Club
- Machine Learning Summary
- ML
- Quantum Matter Journal Club
- rp587
- TCM Seminar Room, Cavendish Laboratory, Department of Physics
- TQS Journal Clubs
- yk373's list
Note: Ex-directory lists are not shown.