University of Cambridge > > Machine Learning Journal Club > Loopy Belief Propagation

Loopy Belief Propagation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Philip Sterne.

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

This talk is part of the Machine Learning Journal Club series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity