DeepAI AI Chat
Log In Sign Up

Exact MAP Inference by Avoiding Fractional Vertices

03/08/2017
by   Erik M. Lindgren, et al.
0

Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open question is to explain why this is true. We give a natural condition under which we can provably perform MAP inference in polynomial time. We require that the number of fractional vertices in the LP relaxation exceeding the optimal solution is bounded by a polynomial in the problem size. This resolves an open question by Dimakis, Gohari, and Wainwright. In contrast, for general LP relaxations of integer programs, known techniques can only handle a constant number of fractional vertices whose value exceeds the optimal solution. We experimentally verify this condition and demonstrate how efficient various integer programming methods are at removing fractional solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/09/2019

MAP Inference via L2-Sphere Linear Program Reformulation

Maximum a posteriori (MAP) inference is an important task for graphical ...
07/02/2019

Approximate Sherali-Adams Relaxations for MAP Inference via Entropy Regularization

Maximum a posteriori (MAP) inference is a fundamental computational para...
08/31/2015

Maximum Persistency via Iterative Relaxed Inference with Graphical Models

We consider the NP-hard problem of MAP-inference for undirected discrete...
11/06/2017

Alpha-expansion is Exact on Stable Instances

Approximate algorithms for structured prediction problems---such as the ...
07/30/2019

Linear Programming complementation and its application to fractional graph theory

In this paper, we introduce a new kind of duality for Linear Programming...