2000 character limit reached
Beyond Log-Supermodularity: Lower Bounds and the Bethe Partition Function (1309.6859v1)
Published 26 Sep 2013 in cs.DM and math.CO
Abstract: A recent result has demonstrated that the Bethe partition function always lower bounds the true partition function of binary, log-supermodular graphical models. We demonstrate that these results can be extended to other interesting classes of graphical models that are not necessarily binary or log-supermodular: the ferromagnetic Potts model with a uniform external field and its generalizations and special classes of weighted graph homomorphism problems.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
