Efficient Exact Inference in Planar Ising Models

by   Nicol N. Schraudolph, et al.

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it does not impose any submodularity constraints; instead we require planarity to establish a correspondence with perfect matchings (dimer coverings) in an expanded dual graph. We implement a unified framework while delegating complex but well-understood subproblems (planar embedding, maximum-weight perfect matching) to established algorithms for which efficient implementations are freely available. Unlike graph cut methods, we can perform penalized maximum-likelihood as well as maximum-margin parameter estimation in the associated conditional random fields (CRFs), and employ marginal posterior probabilities as well as maximum a posteriori (MAP) states for prediction. Maximum-margin CRF parameter estimation on image denoising and segmentation problems shows our approach to be efficient and effective. A C++ implementation is available from http://nic.schraudolph.org/isinf/


page 28

page 31

page 32


A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs

We propose a fixed-parameter tractable algorithm for the Max-Cut problem...

Marginal Independence Models

We impose rank one constraints on marginalizations of a tensor, given by...

Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs

We propose two fixed-parameter tractable algorithms for the weighted Max...

Fast Stochastic Quadrature for Approximate Maximum-Likelihood Estimation

Recent stochastic quadrature techniques for undirected graphical models...

Generalized Cut Polytopes for Binary Hierarchical Models

Marginal polytopes are important geometric objects that arise in statist...

Parameter Learning for Log-supermodular Distributions

We consider log-supermodular models on binary variables, which are proba...

Bethe Bounds and Approximating the Global Optimum

Inference in general Markov random fields (MRFs) is NP-hard, though iden...