DeepAI AI Chat
Log In Sign Up

Efficiently Searching for Frustrated Cycles in MAP Inference

by   David Sontag, et al.

Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to introduce additional constraints that explicitly enforce cycle consistency. Earlier work showed that cluster-pursuit algorithms, which iteratively introduce cycle and other higherorder consistency constraints, allows one to exactly solve many hard inference problems. However, these algorithms explicitly enumerate a candidate set of clusters, limiting them to triplets or other short cycles. We solve the search problem for cycle constraints, giving a nearly linear time algorithm for finding the most frustrated cycle of arbitrary length. We show how to use this search algorithm together with the dual decomposition framework and clusterpursuit. The new algorithm exactly solves MAP inference problems arising from relational classification and stereo vision.


page 1

page 2

page 3

page 4


Short Cycles via Low-Diameter Decompositions

We present improved algorithms for short cycle decomposition of a graph....

Alternating Directions Dual Decomposition

We propose AD3, a new algorithm for approximate maximum a posteriori (MA...

Tightening LP Relaxations for MAP using Message Passing

Linear Programming (LP) relaxations have become powerful tools for findi...

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions

We develop a framework for graph sparsification and sketching, based on ...

Distributed Anytime MAP Inference

We present a distributed anytime algorithm for performing MAP inference ...

Tightening MRF Relaxations with Planar Subproblems

We describe a new technique for computing lower-bounds on the minimum en...

Dual Decomposition from the Perspective of Relax, Compensate and then Recover

Relax, Compensate and then Recover (RCR) is a paradigm for approximate i...

Code Repositories


Implementation of MPLP by Amir Globerson, David Sontag, Do Kook Choe, & Yitao Li

view repo