Questions tagged [belief-propagation]

Belief propagation, also known as sum-product message passing, is a message-passing algorithm for performing inference on graphical models, such as Bayesian networks and Markov random fields.

Filter by
Sorted by
Tagged with
1
vote
0answers
13 views

How to solve this belief propagation question?

enter image description here I'm not sure how to solve this question. I understand that it involves belief propagation but beyond that I'm entirely lost. Generally speaking, we have G1, one machine ...
0
votes
0answers
11 views

Belief Propagation vs Gibbs Sampling

In general what are the cons and pros of using Gibbs sampling to estimate a complex posterior (assuming we can sample from the conditionals) over belief propagation (using a factor graph)?
0
votes
1answer
32 views

Drawing a bayesian network and then converting to a factor graph to implement max-product algorithm

I'm trying to understand the fully worked example 5.2 in "Bayesian Reasoning and Machine Learning" by David Barber. Frustratingly the explanations around the example are all about potentials and ...
3
votes
0answers
24 views

Model or State Uncertainty in Queueing Model due to uncertain arrival rate

$\textbf{Introduction}$ I am currently modelling a scenario where two queues need to be served by a single server in a non preemptive discipline. I am quite sorted on generating the optimal policy ...
1
vote
0answers
94 views

What is the relation between message passing and probabilities in Bayesian inference?

The belief propagation algorithm is a message passing algorithm that can be used to estimate marginal probabilities on Bayesian networks. What is the definition of these messages? What is the ...
1
vote
1answer
134 views

What is the difference between belief propagation and loopy belief propagation?

Belief propagation (BP) is an algorithm (or a family of algorithms) that can be used to perform inference on graphical models (e.g. a Bayesian network). BP can produce exact results on cycle-free ...
1
vote
0answers
168 views

Bayesian Networks - Factor Graphs - Belief Propagation - Numerical stability

I am trying to do inference for a Bayesian Network with discrete probabilities. I converted the network to a factor graph and implemented the sum-product algorithm (belief propagation). My goal is ...
1
vote
2answers
391 views

How does Dempster-Shafer relate to Machine Learning?

I read Dempster-Schafer can be thought of as a generalization of Bayesian theory. Say I have data from disparate sources that indicate the class of some object. If I have some prior beliefs about the ...
1
vote
0answers
25 views

Can belief propagation be used to infer latent variables?

Consider a simple Bayes net of linear Gaussian, $A\rightarrow B \leftarrow C$. If $B$ is observed, $A$ and $C$ are hidden (assume we have set priors for the hiddent variables), can we use belief ...
0
votes
1answer
117 views

Graphical Model: MAP optimization vs belief propagation

Assume there are three types (sets) of variables $X$, $Y$ and $Z$ in a graphical model where $X = \{x_1,x_2,\dots,x_m\}$, $Y = \{y_1,y_2,\dots,y_n \}$ and $Z = \{z_1,z_2,\dots,z_k\}$. Further, $Z$ is ...
1
vote
0answers
166 views

Is this a really a belief propagation problem?

BACKGROUND This is basically a reputation problem that involves a set of interacting entities $e_i$. Each entity has, in principle, a reputation vector $\vec{b}_i$. That reputation depends on what ...
1
vote
0answers
26 views

Sum-product algorithm in polytrees

I want to do exact inference in a polytree structured DAG. I know that the Sum-product algorithm always converges for trees and I have also read that the algorithm can be extended for polytrees, but I ...
1
vote
1answer
143 views

Bethe approximation for factor graphs

I am confused at computing Bethe approximation for factor graphs in here. It generalizes Bethe approxmiation in a pairwise case. However, I am wondering why (75) goes to (78) with (76): We can verify ...
0
votes
1answer
141 views

How to compute the Gibbs free energy in Bethe approximation for MRF

Hi, I am learning loopy belief propagation for MRF. The general roadmap is to define a Bethe approximation, which is exact for a tree but wrong for general graphs. I'm currently stuck at the point to ...
3
votes
1answer
195 views

How do you do belief propagation on nodes with conditional dependence?

Take this graph: $$ \overset{S}{\fbox{$+$}} \underset{\textstyle \nwarrow \!\underset{\overset{\scriptstyle X_2}{\textstyle\bigcirc}} {}} {\overset{\textstyle \swarrow \!\overset{\...
0
votes
0answers
220 views

Updating a belief using a particle filter

I am using a particle filter to update a belief (the context is the POMCP algorithm found in Silver & Veness, "Monte-Carlo Planning in Large POMDPs"). A belief is represented as a probability mass ...
5
votes
1answer
2k views

Belief propagation using pgmpy lib - algorithm understanding

I am now starting to use pgmpy lib for probabailistic graphical model implementation. The probability that I get using this lib differs from the one I get manually (e.g. using SamIam). Here is a ...
3
votes
0answers
578 views

Can (loopy) belief propagation be used to learn from a data set?

I'm trying to expand my experience with restricted Boltzmann machines to a more general class of graphical models and currently learning about belief propagation using message passing algorithms. One ...
1
vote
0answers
48 views

A question on notation in variational message passing

This paper introduces variational message passing. Formula (8) is based on Fig 1. Formula (a) is $\ln Q^*_j(H_j)=\langle\ln P(H_j\mid\vec{pa_j})\rangle_{\sim Q(H_j)}+\sum_{k\in ch_j}\langle\ln P(X_k\...
3
votes
0answers
67 views

Is the posterior a sufficient statistic when observations are conditionally independent?

Suppose there are two random variables, $X_1$ and $X_2$, and we're trying to infer $\theta$. If $X_1$ and $X_2$ are conditionally independent, then is $f(\theta|X_1)$ a sufficient statistic for $X_1$?...
3
votes
1answer
521 views

How do you find mathematical expressions for the posterior marginals i.e. $P(x_n|y_0, … , y_n)$ in an HMM?

My goal is to find closed form equations for posterior marginals $P(x_n|y_0, ... , y_n)$ in a general HMM. I was told that we can calculate it exactly via BP (belief propagation, thought not sure how ...