Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

04/14/2020
by   Stefan Haller, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2019

Approximate Sherali-Adams Relaxations for MAP Inference via Entropy Regularization

Maximum a posteriori (MAP) inference is a fundamental computational para...
research
10/24/2014

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

We consider the energy minimization problem for undirected graphical mod...
research
08/31/2015

Maximum Persistency via Iterative Relaxed Inference with Graphical Models

We consider the NP-hard problem of MAP-inference for undirected discrete...
research
05/09/2019

MAP Inference via L2-Sphere Linear Program Reformulation

Maximum a posteriori (MAP) inference is an important task for graphical ...
research
01/13/2020

LP-SparseMAP: Differentiable Relaxed Optimization for Sparse Structured Prediction

Structured prediction requires manipulating a large number of combinator...
research
11/19/2019

Property Testing of LP-Type Problems

Given query access to a set of constraints S, we wish to quickly check i...
research
01/23/2014

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

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

Please sign up or login with your details

Forgot password? Click here to reset