Systematic vs. Non-systematic Algorithms for Solving the MPE Task

The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic information is constructed during search and allows dynamic variable/value ordering) and its predecessor BBMB (for which the heuristic information is pre-compiled) and compares them against a number of popular local search algorithms for the MPE problem as well as against the recently popular iterative belief propagation algorithms. We show empirically that the new Branch and Bound algorithm, BBBT demonstrates tremendous pruning of the search space far beyond its predecessor, BBMB which translates to impressive time saving for some classes of problems. Second, when viewed as approximation schemes, BBBT/BBMB together are highly competitive with the best known SLS algorithms and are superior, especially when the domain sizes increase beyond 2. The results also show that the class of belief propagation algorithms can outperform SLS, but they are quite inferior to BBMB/BBBT. As far as we know, BBBT/BBMB are currently among the best performing algorithms for solving the MPE task.

[1]  Rina Dechter,et al.  Iterative Join-Graph Propagation , 2002, UAI.

[2]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

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

[4]  Rina Dechter,et al.  Mini-buckets: a general scheme for approximating inference , 2002 .

[5]  Javier Larrosa,et al.  A General Scheme for Multiple Lower Bound Computation in Constraint Optimization , 2001, CP.

[6]  Edward P. K. Tsang,et al.  Guided Local Search for Solving SAT and Weighted MAX-SAT Problems , 2000, Journal of Automated Reasoning.

[7]  James D. Park.  Using weighted MAX-SAT engines to solve MPE , 2002, AAAI/IAAI.

[8]  Benjamin W. Wah,et al.  Discrete Lagrangian-Based Search for Solving MAX-SAT Problems , 1997, IJCAI.

[9]  R. Dechter,et al.  Stochastic Local Search for Bayesian Networks , 1999 .

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

[11]  Rina Dechter,et al.  Mini-buckets: A general scheme for bounded inference , 2003, JACM.

[12]  Rina Dechter,et al.  A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..

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

[14]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[15]  Rina Dechter,et al.  Tree approximation for belief updating , 2002, AAAI/IAAI.

[16]  Rina Dechter,et al.  Stochastic local search for Bayesian network , 1999, AISTATS.

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