Distributed Anytime MAP Inference

02/14/2012
by   Joop van de Ven, et al.
0

We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that allows application of the Dantzig-Wolfe decomposition principle. Subprograms are defined over individual edges and can be computed in a distributed manner. This accommodates solutions to graphs whose state space does not fit in memory. The decomposition master program is guaranteed to compute the optimal solution in a finite number of iterations, while the solution converges monotonically with each iteration. Formulating the MAP inference problem as a linear program allows additional (global) constraints to be defined; something not possible with message passing algorithms. Experimental results show that our algorithm's solution quality outperforms most current algorithms and it scales well to large problems.

READ FULL TEXT

Authors

05/09/2012

MAP Estimation, Message Passing, and Perfect Graphs

Efficiently finding the maximum a posteriori (MAP) configuration of a gr...
07/02/2019

Approximate Sherali-Adams Relaxations for MAP Inference via Entropy Regularization

Maximum a posteriori (MAP) inference is a fundamental computational para...
09/26/2013

Tighter Linear Program Relaxations for High Order Graphical Models

Graphical models with High Order Potentials (HOPs) have received conside...
06/13/2012

Tightening LP Relaxations for MAP using Message Passing

Linear Programming (LP) relaxations have become powerful tools for findi...
05/29/2012

Generalized sequential tree-reweighted message passing

This paper addresses the problem of approximate MAP-MRF inference in gen...
05/13/2018

Accelerating Message Passing for MAP with Benders Decomposition

We introduce a novel mechanism to tighten the local polytope relaxation ...
10/16/2012

Efficiently Searching for Frustrated Cycles in MAP Inference

Dual decomposition provides a tractable framework for designing algorith...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.