On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
Applications
2011-03-03 v1 Information Theory
math.IT
Computational Physics
Abstract
Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition function of a given probabilistic inference problem. Using the entropies of the sub-trees we proved an inequality that compares the lower bounds obtained from different sub-trees. In this paper we investigate the properties of one specific lower bound, namely the lower bound computed by the minimum entropy sub-tree. We also investigate the relationship between the minimum entropy sub-tree and the sub-tree that gives the best lower bound.
Cite
@article{arxiv.1103.0377,
title = {On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function},
author = {Mehdi Molkaraie and Payam Pakzad},
journal= {arXiv preprint arXiv:1103.0377},
year = {2011}
}