mlsanityData to 14 Oct 2026

Understanding the Behavior of Belief Propagation

arXiv 2209.05464 ↗First posted 5 Sep 2022cs.AI cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Probabilistic graphical models are a powerful concept for modeling high-dimensional distributions. Besides modeling distributions, probabilistic graphical models also provide an elegant framework for performing statistical inference; because of the high-dimensional nature, however, one must often use approximate methods for this purpose. Belief propagation performs approximate inference, is efficient, and looks back on a long success-story. Yet, in most cases, belief propagation lacks any performance and convergence guarantees. Many realistic problems are presented by graphical models with loops, however, in which case belief propagation is neither guaranteed to provide accurate estimates nor that it converges at all. This thesis investigates how the model parameters influence the performance of belief propagation. We are particularly interested in their influence on (i) the number of fixed points, (ii) the convergence properties, and (iii) the approximation quality.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 155 references that are in the map. First posted on arXiv 5 Sep 2022.

Builds on

13 of 155 references.

References · 13

  1. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  2. 2013Loopy Belief Propagation for Approximate Inference: An Empirical Studycited by 76
  3. 2014Spectral Clustering of Graphs with the Bethe Hessiancited by 23
  4. 2016Fixed Points of Belief Propagation -- An Analysis via Polynomial Homotopy Continuationcited by 4
  5. 2017Belief Propagation in Conditional RBMs for Structured Predictioncited by 4
  6. 2018Self-Guided Belief Propagation -- A Homotopy Continuation Methodcited by 4
  7. 2013Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagationcited by 3
  8. 2013Approximating the Bethe partition functioncited by 3
  9. 2014Revisiting Algebra and Complexity of Inference in Graphical Modelscited by 2
  10. 2018Gauged Mini-Bucket Elimination for Approximate Inferencecited by 2
  11. 2014Perturbed Message Passing for Constraint Satisfaction Problemscited by 1
  12. 2015Clamping Improves TRW and Mean Field Approximationscited by 1
1 more
  1. 2015On the Network Topology Dependent Solution Count of the Algebraic Load Flow Equationscited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.