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

10/20/2017
by   Andrii Riazanov, et al.
0

Belief Propagation algorithms are instruments used broadly to solve graphical model optimization and statistical inference problems. In the general case of a loopy Graphical Model, Belief Propagation is a heuristic which is quite successful in practice, even though its empirical success, typically, lacks theoretical guarantees. This paper extends the short list of special cases where correctness and/or convergence of a Belief Propagation algorithm is proven. We generalize formulation of Min-Sum Network Flow problem by relaxing the flow conservation (balance) constraints and then proving that the Belief Propagation algorithm converges to the exact result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2022

Understanding the Behavior of Belief Propagation

Probabilistic graphical models are a powerful concept for modeling high-...
research
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...
research
05/26/2021

Convex Combination Belief Propagation Algorithms

We introduce new message passing algorithms for inference with graphical...
research
10/02/2022

Belief propagation generalizes backpropagation

The two most important algorithms in artificial intelligence are backpro...
research
08/21/2017

The p-convolution forest: a method for solving graphical models with additive probabilistic equations

Convolution trees, loopy belief propagation, and fast numerical p-convol...
research
07/26/2021

Belief Propagation as Diffusion

We introduce novel belief propagation algorithms to estimate the margina...
research
09/29/2007

Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching

A recent paper CaeCaeSchBar06 proposed a provably optimal, polynomial ti...

Please sign up or login with your details

Forgot password? Click here to reset