Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching

We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact computation of MAP states in hitherto intractable binary Markov random fields. Our method solves an n

• Type: Journal
• Year: 2010
• Where: JMLR
• Authors: Nic Schraudolph
• Keywords: Intractable Binary Markov, JMLR 2010, Perfect Matchings, Wainwright Et