no code implementations • NeurIPS 2013 • Jinwoo Shin, Andrew E. Gelfand, Misha Chertkov
It was recently shown that BP converges to the correct MAP assignment for a class of loopy GMs with the following common feature: the Linear Programming (LP) relaxation to the MAP problem is tight (has no integrality gap).
