A Comparison of Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer Architectures for Computing Marginals of Probability Distributions

01/30/2013
by   Vasilica Lepar, et al.
0

In the last decade, several architectures have been proposed for exact computation of marginals using local computation. In this paper, we compare three architectures - Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer - from the perspective of graphical structure for message propagation, message-passing scheme, computational efficiency, and storage efficiency.

READ FULL TEXT

page 1

page 3

page 5

page 6

page 7

page 8

page 9

page 10

research
09/23/2020

Message passing for probabilistic models on networks with loops

In this paper, we extend a recently proposed framework for message passi...
research
05/05/2021

A unifying tutorial on Approximate Message Passing

Over the last decade or so, Approximate Message Passing (AMP) algorithms...
research
01/18/2016

Proactive Message Passing on Memory Factor Networks

We introduce a new type of graphical model that we call a "memory factor...
research
05/10/2011

Feedback Message Passing for Inference in Gaussian Graphical Models

While loopy belief propagation (LBP) performs reasonably well for infere...
research
03/27/2013

An Axiomatic Framework for Bayesian and Belief-function Propagation

In this paper, we describe an abstract framework and axioms under which ...
research
12/12/2012

Distributed Planning in Hierarchical Factored MDPs

We present a principled and efficient planning algorithm for collaborati...
research
11/29/2022

A two-scale solver for linear elasticity problems in the context of parallel message passing

This paper pushes further the intrinsic capabilities of the GFEM^gl glob...

Please sign up or login with your details

Forgot password? Click here to reset