Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees

12/16/2012
by   Nima Noorshams, et al.
0

The sum-product or belief propagation (BP) algorithm is a widely used message-passing technique for computing approximate marginals in graphical models. We introduce a new technique, called stochastic orthogonal series message-passing (SOSMP), for computing the BP fixed point in models with continuous random variables. It is based on a deterministic approximation of the messages via orthogonal series expansion, and a stochastic approximation via Monte Carlo estimates of the integral updates of the basis coefficients. We prove that the SOSMP iterates converge to a δ-neighborhood of the unique BP fixed point for any tree-structured graph, and for any graphs with cycles in which the BP updates satisfy a contractivity condition. In addition, we demonstrate how to choose the number of basis coefficients as a function of the desired approximation accuracy δ and smoothness of the compatibility functions. We illustrate our theory with both simulated examples and in application to optical flow estimation.

READ FULL TEXT

page 19

page 20

research
11/04/2011

Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm

The sum-product or belief propagation (BP) algorithm is a widely-used me...
research
09/08/2011

The Complexity of Approximating a Bethe Equilibrium

This paper resolves a common complexity issue in the Bethe approximation...
research
07/04/2012

On the optimality of tree-reweighted max-product message-passing

Tree-reweighted max-product (TRW) message passing is a modified form of ...
research
11/14/2013

Anytime Belief Propagation Using Sparse Domains

Belief Propagation has been widely used for marginal inference, however ...
research
09/26/2013

Structured Message Passing

In this paper, we present structured message passing (SMP), a unifying f...
research
05/22/2015

Diffusion Methods for Classification with Pairwise Relationships

We define two algorithms for propagating information in classification p...
research
01/26/2014

Perturbed Message Passing for Constraint Satisfaction Problems

We introduce an efficient message passing scheme for solving Constraint ...

Please sign up or login with your details

Forgot password? Click here to reset