Semiring-Based Mini-Bucket Partitioning Schemes / 644
Emma Rollon, Javier Larrosa, Rina Dechter

Graphical models are one of the most prominent frameworks to model complex systems and efficiently query them. Their underlying algebraic properties are captured by a valuation structure that, most usually, is a semiring. Depending on the semiring of choice, we can capture probabilistic models, constraint networks, cost networks, etc. In this paper we address the partitioning problem which occurs in many approximation techniques such as mini-bucket elimination and join-graph propagation algorithms. Roughly speaking, subject to complexity bounds, the algorithm needs to find a partition of a set of factors such that best approximates the whole set. While this problem has been addressed in the past in a particular case, we present here a general description. Furthermore, we also propose a  general partitioning scheme. Our proposal is general in the sense that it is  presented in terms of a generic semiring with the only additional requirements of a division operation and a refinement of its order. The proposed algorithm  instantiates to the particular task of computing the probability of evidence, but also applies directly to other important reasoning tasks. We demonstrate its good empirical behaviour on the problem of computing the most probable explanation.