Exact MAP inference in general higher-order graphical models using linear programming

ArXi:1709.09051v2 Announce Type: replace-cross This paper is concerned with the problem of exact MAP inference in general higher-order graphical models by means of a traditional linear programming relaxation approach. In fact, the proof that we have developed in this paper is a rather simple algebraic proof being made straightforward, above all, by the