Abstract

A probabilistic inference problem is concerned with computing the partition function and the marginals of a global probability distribution. We investigate upper and lower bounds on the partition function of a given inference problem. Our bounds depend on the partition function of any sub-junction tree of a given junction graph representing the inference problem. In a Theorem we compare such bounds using the entropies of the sub-junction trees. Finally we propose a greedy algorithm that computes low-complexity bounds on the partition function. Simulation results on two-dimensional grids are reported.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.