Faster Algorithms for Max-Product Message-Passing

10/17/2009
by   Julian J. McAuley, et al.
0

Maximum A Posteriori inference in graphical models is often solved via message-passing algorithms, such as the junction-tree algorithm, or loopy belief-propagation. The exact solution to this problem is well known to be exponential in the size of the model's maximal cliques after it is triangulated, while approximate inference is typically exponential in the size of the model's factors. In this paper, we take advantage of the fact that many models have maximal cliques that are larger than their constituent factors, and also of the fact that many factors consist entirely of latent variables (i.e., they do not depend on an observation). This is a common case in a wide variety of applications, including grids, trees, and ring-structured models. In such cases, we are able to decrease the exponent of complexity for message-passing by 0.5 for both exact and approximate inference.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2012

Convergent message passing algorithms - a unifying view

Message-passing algorithms have emerged as powerful techniques for appro...
research
09/22/2013

A new look at reweighted message passing

We propose a new family of message passing techniques for MAP estimation...
research
07/27/2017

Anytime Exact Belief Propagation

Statistical Relational Models and, more recently, Probabilistic Programm...
research
05/10/2011

Feedback Message Passing for Inference in Gaussian Graphical Models

While loopy belief propagation (LBP) performs reasonably well for infere...
research
06/21/2016

Graphical Models for Optimal Power Flow

Optimal power flow (OPF) is the central optimization problem in electric...
research
06/25/2018

A Unified Model with Structured Output for Fashion Images Classification

A picture is worth a thousand words. Albeit a cliché, for the fashion in...
research
10/27/2014

Consensus Message Passing for Layered Graphical Models

Generative models provide a powerful framework for probabilistic reasoni...

Please sign up or login with your details

Forgot password? Click here to reset