Parallel Belief Propagation in Factor Graphs

Joseph E. Gonzalez, Yucheng Low, Carlos GuestrinCambridge 2011 · DOI · OpenAlex

Abstract

Probabilistic graphical models are used in a wide range of machine learning applications. From reasoning about protein interactions (Jaimovich et al., 2006) to stereo vision (Sun, Shum, and Zheng, 2002), graphical models have facilitated the application of probabilistic methods to challenging machine learning problems. A core operation in probabilistic graphical models is inference – the process of computing the probability of an event given particular observations. Although inference is NP-complete in general, there are several popular approximate inference algorithms that typically perform well in practice. Unfortunately, the approximate inference algorithms are still computationally intensive and therefore can benefit from parallelization. In this chapter, we parallelize loopy belief propagation (or loopy BP in short), which is used in a wide range of ML applications (Jaimovich et al., 2006; Sun et al., 2002; Lan et al., 2006; Baron, Sarvotham, and Baraniuk, 2010; Singla and Domingos, 2008).
BibTeX
@inproceedings{gonzalez2011parallel,
  author = {Joseph E. Gonzalez and Yucheng Low and Carlos Guestrin},
  title = {{Parallel Belief Propagation in Factor Graphs}},
  booktitle = {Cambridge},
  year = {2011},
  doi = {10.1017/cbo9781139042918.011},
}

Loading related content...

Figure