Beyond Log-Supermodularity: Lower Bounds and the Bethe Partition Function
Discrete Mathematics
2013-09-27 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1309.6859,
title = {Beyond Log-Supermodularity: Lower Bounds and the Bethe Partition Function},
author = {Nicholas Ruozzi},
journal= {arXiv preprint arXiv:1309.6859},
year = {2013}
}
Comments
Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI2013)