Abstract
Mini-Bucket Elimination (MBE) is a well-known approximation of Bucket Elimination (BE), deriving bounds on quantities of interest over graphical models. Both algorithms are based on the sequential transformation of the original problem by eliminating variables, one at a time. The order in which variables are eliminated is usually computed using the greedy min-fill heuristic. In the BE case, this heuristic has a clear intuition, because it faithfully represents the structure of the sequence of sub-problems that BE generates and orders the variables using a greedy criteria based on such structure. However, MBE produces a sequence of sub-problems with a different structure. Therefore, using the min-fill heuristic with MBE means that decisions are made using the structure of the sub-problems that BE would produce, which is clearly meaningless. In this paper we propose a modification of the min-fill ordering heuristic that takes into account this fact. Our experiments on a number of benchmarks over two important tasks (i.e., computing the probability of evidence and optimization) show that MBE using the new ordering is often far more accurate than using the standard one.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertelè, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, London (1972)
Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113, 41–85 (1999)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Dechter, R., Kask, K., Mateescu, R.: Iterative join-graph propagation. In: Proceedings of the 18th Conference in UAI, Edmonton, Canada, pp. 128–136 (2002)
Dechter, R., Rish, I.: Mini-buckets: A general scheme for bounded inference. Journal of the ACM 50(2), 107–153 (2003)
Freuder, E.: A sufficient condition for backtrack-free search. Journal of the ACM 29, 24–32 (1982)
Kask, K., Dechter, R.: A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence 129, 91–131 (2001)
Pearson, M., Leyton-Brown, K., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM E-Commerce, pp. 66–76 (2000)
Larkin, D.: Approximate decomposition: A method for bounding and estimating probabilistic and deterministic queries. In: Proceedings UAI, Acapulco, Mexico, pp. 346–353 (2003)
Larkin, D.: Semi-independent partitioning: A method for bounding the solution to cop’s. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 894–898. Springer, Heidelberg (2003)
Park, J.D.: Using weighted max-sat engines to solve mpe. In: Proc. of the 18th AAAI, Edmonton, Alberta, Canada, pp. 682–687 (2002)
Rollon, E., Dechter, R.: New mini-bucket partitioning heuristics for bounding the probability of evidence. In: Proc. of the 24th AAAI, Atlanta, Georgia, USA (2010)
Shenoy, P.: Axioms for dynamic programming. In: Computational Learning and Probabilistic Reasoning, pp. 259–275 (1996)
Wemmenhove, B., Mooij, J.M., Wiegerinck, W., Leisink, M.A.R., Kappen, H.J., Neijt, J.P.: Inference in the promedas medical expert system. In: 11th Conference on Artificial Intelligence in Medicine, Amsterdam, The Netherlands, pp. 456–460 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rollon, E., Larrosa, J. (2011). On Mini-Buckets and the Min-fill Elimination Ordering. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)