Approximation Bounds for Inference using Cooperative Cut
Stefanie Jegelka and Jeff Bilmes
In: ICML 2011, 28 June - 02 July, Bellevue, USA.
We analyze a family of probability distributions that are characterized by an embedded combinatorial structure. This family includes models having arbitrary treewidth and arbitrary sized factors. Unlike general models with such freedom, where the “most probable explanation” (MPE) problem is inapproximable, the combinatorial structure within our model, in particular the indirect use of submodularity, leads to several MPE algorithms that all have approximation guarantees.