Modified Belief Propagation: an Algorithm for Optimization Problems
published: Feb. 25, 2007, recorded: January 2005, views: 4639
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Belief propagation is a well known algorithm to solve various optimization problems, such as error correcting codes graph colouring and satisfiability problems. It generally works well in areas where the replica symmetric approximation holds, but breaks down when replica symmetry breaking occurs. Alternatives such as Survey Propagation have been proposed with great success, but are generally limited to the zero temperature limit. We propose a simple modification to Belief Propagation that can also successfully deal with finite temperature scenarios, and illustrate its efficiency on several examples.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !