On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function

Details On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function

2011-03-02

arxiv.org/abs/1103.0377v1

Statistics

Applications

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473858