Maximum Persistency via Iterative Relaxed Inference with Graphical Models

Alexander Shekhovtsov, Paul Swoboda, Bogdan Savchynskyy

We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of it…