Simplicity and Complexity of Belief-Propagation

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

• Elchanan Mossel (MIT)
• Monday 14 October 2019, 16:30-17:30
• Centre for Mathematical Sciences MR2.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Centre for Mathematical Sciences MR2
• Chris Davis' list
• DAMTP Departmental Seminar
• DAMTP info aggregator
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Faculty of Mathematics Lectures
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• Machine Learning
• Peter Whittle Lecture
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• ndb35's list
• rp587

Note that ex-directory lists are not shown.