[edit]
Beyond Log-Supermodularity: Lower Bounds and the Bethe Partition Function
Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence, PMLR R11:618-627, 2013.
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 demon- strate 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.