DeepAI AI Chat
Log In Sign Up

Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

by   Stefan Haller, et al.
University of Heidelberg

We consider the MAP-inference problem for graphical models, which is a valued constraint satisfaction problem defined on real numbers with a natural summation operation. We propose a family of relaxations (different from the famous Sherali-Adams hierarchy), which naturally define lower bounds for its optimum. This family always contains a tight relaxation and we give an algorithm able to find it and therefore, solve the initial non-relaxed NP-hard problem. The relaxations we consider decompose the original problem into two non-overlapping parts: an easy LP-tight part and a difficult one. For the latter part a combinatorial solver must be used. As we show in our experiments, in a number of applications the second, difficult part constitutes only a small fraction of the whole problem. This property allows to significantly reduce the computational time of the combinatorial solver and therefore solve problems which were out of reach before.


page 1

page 2

page 3

page 4


Approximate Sherali-Adams Relaxations for MAP Inference via Entropy Regularization

Maximum a posteriori (MAP) inference is a fundamental computational para...

Partial Optimality by Pruning for MAP-Inference with General Graphical Models

We consider the energy minimization problem for undirected graphical mod...

Maximum Persistency via Iterative Relaxed Inference with Graphical Models

We consider the NP-hard problem of MAP-inference for undirected discrete...

Property Testing of LP-Type Problems

Given query access to a set of constraints S, we wish to quickly check i...

Efficient semidefinite bounds for multi-label discrete graphical models

By concisely representing a joint function of many variables as the comb...

LP-SparseMAP: Differentiable Relaxed Optimization for Sparse Structured Prediction

Structured prediction requires manipulating a large number of combinator...

A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing

Dual decomposition, and more generally Lagrangian relaxation, is a class...