University of Cambridge > > Peter Whittle Lecture > Simplicity and Complexity of Belief-Propagation

Simplicity and Complexity of Belief-Propagation

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

If you have a question about this talk, please contact HoD Secretary, DPMMS.

There is a very simple algorithm for the inference of posteriors for probability models on trees. This algorithm, known as ``Belief Propagation” is widely used in coding theory, in machine learning, in evolutionary inference, among many other areas. The talk will be devoted to the analysis of Belief Propagation in some of the simplest probability models. We will highlight the interplay between Belief Propagation, linear estimators (statistics), the Kesten-Stigum bound (probability) and Replica Symmetry Breaking (statistical physics). We will show how the analysis of Belief Propagation allowed to proof phase transitions for phylogenetic reconstruction in evolutionary biology and develop optimal algorithms for inference of block models. Finally, we will discuss the computational complexity of this ``simple” algorithm.

A wine reception will follow this talk in the Central Core.

This talk is part of the Peter Whittle Lecture 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