Recursive sum-product algorithm for generalized outer-planar graphs

Authors:
Qiang Cheng;Feng Chen;Wenli Xu;Song Wang
Affiliations:
Tsinghua National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing 100084, PR China;Tsinghua National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing 100084, PR China;Tsinghua National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing 100084, PR China;Department of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208, USA
Venue:
Information Processing Letters
Year:
2012

Citing 10
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Introduction

Journal of Functional Programming
Graph Theory

Graph Theory
Graphical Models, Exponential Families, and Variational Inference

Foundations and Trends® in Machine Learning
Convexifying the Bethe free energy

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning

Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning
On dual decomposition and linear programming relaxations for natural language processing

EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Constructing free-energy approximations and generalized belief propagation algorithms

IEEE Transactions on Information Theory
A new class of upper bounds on the log partition function

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

Inference on cyclic graphs is one of the most important problems in the applications of graphical models. While exact inference is NP-hard on general cyclic graphs, it has been found that exact inference can be achieved with a computational complexity as low as O(Nm^3) on the outer-planar graph, which is a special kind of cyclic graph. In this paper, we introduce a new kind of cyclic graph, the generalized outer-planar (GOP) graph, which is more general than the outer-planar graph and show that the exact inference on the GOP graphs can be achieved in O(Nm^3) by a recursive sum-product (RSP) algorithm. RSP exploits the property of GOP graphs that the faces are reducible, and brings a ''face elimination'' procedure to compute the marginals exactly. Furthermore, RSP can be implemented on general cyclic graphs to obtain approximate marginals. Experimental results show the effectiveness of approximate RSP on various graphical models.