Belief propagation
Algorithm for statistical inference on graphical models / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Belief propagation?
Summarize this article for a 10 year old
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. It calculates the marginal distribution for each unobserved node (or variable), conditional on any observed nodes (or variables). Belief propagation is commonly used in artificial intelligence and information theory, and has demonstrated empirical success in numerous applications, including low-density parity-check codes, turbo codes, free energy approximation, and satisfiability.[1]
This article includes a list of general references, but it lacks sufficient corresponding inline citations. (April 2009) |
The algorithm was first proposed by Judea Pearl in 1982,[2] who formulated it as an exact inference algorithm on trees, later extended to polytrees.[3] While the algorithm is not exact on general graphs, it has been shown to be a useful approximate algorithm.[4]