Approximate inference on planar graphs using Loop Calculus and Belief Propagation
arXiv:0901.0786
Abstract
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006) allows to express the exact partition function of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in (Certkov et al., 2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze the performance of the algorithm for the partition function approximation for models with binary variables and pairwise interactions on grids and other planar graphs. We study in detail both the loop series and the equivalent Pfaffian series and show that the first term of the Pfaffian series for the general, intractable planar model, can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.
23 pages, 10 figures. Submitted to Journal of Machine Learning Research. Proceedings version accepted for UAI 2009
References in corpus (9)
- Loopy Belief Propagation for Approximate Inference: An Empirical Study
- Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing
- Loop series for discrete statistical models on graphs
- Approximate Inference and Constrained Optimization
- Efficient Exact Inference in Planar Ising Models
- Loop Calculus Helps to Improve Belief Propagation and Linear Programming Decodings of Low-Density-Parity-Check Codes
- "Exact" Algorithm for Random-Bond Ising Models in 2D
- Belief Propagation and Loop Series on Planar Graphs
- Loop series expansion with propagation diagrams