Partition-based Anytime Approximation for Belief

The paper presents a parameterized approximation scheme for probabilistic inference. The scheme, called Mini-Clustering (MC) extends the partition-based approximation offered by mini-bucket elimination, to tree de-compositions. The beneet of this extension is that all single variable beliefs are computed (approximately) at once, using a two-phase message-passing process along the cluster tree. The resulting approximation scheme is governed by a controlling parameter, "z" that allows adjustable levels of accuracy and eeciency, in "anytime" style. Empirical evaluation against competing algorithms such as iterative belief propagation and stochas-tic simulation, demonstrate the superiority of the MC approximation scheme for several classes of problems.

[1]  Steffen L. Lauritzen,et al.  Bayesian updating in causal probabilistic networks by local computations , 1990 .

[2]  Xavier Boyen,et al.  Tractable Inference for Complex Stochastic Processes , 1998, UAI.

[3]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[4]  R. Dechter,et al.  Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks , 2001 .

[5]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[6]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[7]  Prakash P. Shenoy,et al.  Probability propagation , 1990, Annals of Mathematics and Artificial Intelligence.

[8]  Michael I. Jordan,et al.  Recursive Algorithms for Approximating Probabilities in Graphical Models , 1996, NIPS.

[9]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[10]  Edward H. Adelson,et al.  Belief Propagation and Revision in Networks with Loops , 1997 .

[11]  Rina Dechter,et al.  Mini-Bucket Heuristics for Improved Search , 1999, UAI.

[12]  Rina Dechter,et al.  A Scheme for Approximating Probabilistic Inference , 1997, UAI.

[13]  Fabio Gagliardi Cozman,et al.  Bucket-Tree Elimination for Automated Reasoning , 2001 .

[14]  Ross D. Shachter,et al.  Simulation Approaches to General Probabilistic Inference on Belief Networks , 2013, UAI.

[15]  Dragomir Anguelov,et al.  A General Algorithm for Approximate Inference and Its Application to Hybrid Bayes Nets , 1999, UAI.

[16]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..