@inproceedings{9d5d2c0da15a4ca790f761b8143facaf,
title = "Tightening fractional covering upper bounds on the partition function for high-order region graphs",
abstract = "In this paper we present a new approach for tightening upper bounds on the partition function. Our upper bounds are based on fractional covering bounds on the entropy function, and result in a concave program to compute these bounds and a convex program to tighten them. To solve these programs effectively for general region graphs we utilize the entropy barrier method, thus decomposing the original programs by their dual programs and solve them with dual block optimization scheme. The entropy barrier method provides an elegant framework to generalize the message-passing scheme to high-order region graph, as well as to solve the block dual steps in closed-form. This is a key for computational relevancy for large problems with thousands of regions.",
author = "Tamir Hazan and Jian Peng and Amnon Shashua",
year = "2012",
language = "American English",
isbn = "9780974903989",
series = "Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012",
pages = "356--366",
booktitle = "Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012",
note = "28th Conference on Uncertainty in Artificial Intelligence, UAI 2012 ; Conference date: 15-08-2012 Through 17-08-2012",
}