Belief propagation passes local messages between factors or neighboring variables to compute marginal distributions or maximizing assignments. On a tree, two directed messages per edge give exact results in time linear in the number of vertices when state spaces are fixed.
Belief propagation (BP) is an algorithm used for performing inference on graphical models, particularly in the context of probabilistic graphical models such as Bayesian networks and Markov random fields. Its primary purpose is to compute marginal distributions of a subset of variables given some observed data. ### Key Concepts: 1. **Graphical Models**: These represent relationships among variables using graphs where nodes represent random variables and edges represent probabilistic dependencies.
New to topics? Read the docs here!