Mini-bucket Elimination with Moment Matching
نویسندگان
چکیده
We investigate a hybrid of two styles of algorithms for deriving bounds for optimization tasks over graphical models: non-iterative message-passing schemes exploiting variable duplication to reduce cluster sizes (e.g. MBE) and iterative methods that re-parameterize the problem’s functions aiming to produce good bounds even if functions are processed independently (e.g. MPLP). In this work we combine both ideas, augmenting MBE with re-parameterization, which we call MBE with Moment Matching (MBE-MM). The results of preliminary empirical evaluations show the clear promise of the hybrid scheme over its individual components (e.g., pure MBE and pure MPLP). Most significantly, we demonstrate the potential of the new bounds in improving the power of mechanically generated heuristics for branch and bound search.
منابع مشابه
Evaluating partition strategies for mini-bucket elimination
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm for graphical models. It relies on a procedure to partition a set of funtions, called bucket, into smaller subsets, called mini-buckets. The impact of the partition process on the quality of the bound computed has never been investigated before. We take first steps to address this issue by presenting a framework within which ...
متن کاملBranch and Bound with Mini-Bucket Heuristics
The paper describes a new generic branch and bound scheme that uses heuristics generated mechanically by the mini-bucket approximation. The scheme is presented and evaluated for the Most Probable Explanation (MPE) task in Bayesian networks. We show that the mini-bucket scheme yields monotonic heuristics of varying strengths which cause different amounts of pruning during search. The resulting B...
متن کاملNew Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure that partitions a set of functions, called bucket, into smaller subsets, called mini-buckets. The method has been used with a single partitioning heuristic throughout, so the impact of the partitioning algorithm on the qu...
متن کاملMini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly, approximation methods become the best option. Mini-bucket Elimination (MBE) is a well known approximation method for combinatorial optimization problems. It has a control parameter z that allow us to trade time and s...
متن کاملA Mini-bucket-based Scheme for Approximating Combinatorial Optimization Tasks: Preliminary Results
The paper addresses the problem of computing lower bounds on the optimal costs associated with each unary assignment of a value to a variable in combinatorial optimization problems. This problem is instrumental in a variety of domains, in particular in proba-bilistic reasoning. Our aim is to use such lower bounds as a look-ahead procedure guiding search algorithms for optimal solutions. In part...
متن کامل