Convex Combination Belief Propagation Algorithms

05/26/2021
by   Anna Grim, et al.
0

We introduce new message passing algorithms for inference with graphical models. The standard min-sum and sum-product belief propagation algorithms are guaranteed to converge when the graph is tree-structured, but may not converge and can be sensitive to the initialization when the graph contains cycles. This paper describes modifications to the standard belief propagation algorithms that are guaranteed to converge to a unique solution regardless of the topology of the graph.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 12

page 13

05/09/2012

Convergent message passing algorithms - a unifying view

Message-passing algorithms have emerged as powerful techniques for appro...
06/20/2012

Convergent Propagation Algorithms via Oriented Trees

Inference problems in graphical models are often approximated by casting...
09/29/2007

Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching

A recent paper CaeCaeSchBar06 proposed a provably optimal, polynomial ti...
01/22/2017

Correct Convergence of Min-Sum Loopy Belief Propagation in a Block Interpolation Problem

This work proves a new result on the correct convergence of Min-Sum Loop...
03/30/2016

On the Geometry of Message Passing Algorithms for Gaussian Reciprocal Processes

Reciprocal processes are acausal generalizations of Markov processes int...
10/20/2017

Belief Propagation Min-Sum Algorithm for Generalized Min-Cost Network Flow

Belief Propagation algorithms are instruments used broadly to solve grap...
05/22/2015

Diffusion Methods for Classification with Pairwise Relationships

We define two algorithms for propagating information in classification p...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.