A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Universality of the Local Marginal Polytope
2015
IEEE Transactions on Pattern Analysis and Machine Intelligence
Preserved Fulltext
We show that solving the LP relaxation of the MAP inference problem in graphical models (also known as the minsum problem, energy minimization, or weighted constraint satisfaction) is not easier than solving any LP. More precisely, any polytope is linear-time representable by a local marginal polytope and any LP can be reduced in linear time to a linear optimization (allowing infinite weights) over a local marginal polytope.
doi:10.1109/tpami.2014.2353626
pmid:26353302
fatcat:vt3ont4d6bgcvh4vfcdkg2uozq