DeepAI
Log In Sign Up

BEEM : Bucket Elimination with External Memory

03/15/2012
by   Kalev Kask, et al.
0

A major limitation of exact inference algorithms for probabilistic graphical models is their extensive memory usage, which often puts real-world problems out of their reach. In this paper we show how we can extend inference algorithms, particularly Bucket Elimination, a special case of cluster (join) tree decomposition, to utilize disk memory. We provide the underlying ideas and show promising empirical results of exactly solving large problems not solvable before.

READ FULL TEXT
07/04/2012

The Relationship Between AND/OR Search and Variable Elimination

In this paper we compare search and inference in graphical models throug...
02/13/2013

Bucket Elimination: A Unifying Framework for Several Probabilistic Inference

Probabilistic inference algorithms for finding the most probable explana...
02/08/2019

Tensor Variable Elimination for Plated Factor Graphs

A wide class of machine learning algorithms can be reduced to variable e...
04/05/2018

Hypertree Decompositions Revisited for PGMs

We revisit the classical problem of exact inference on probabilistic gra...
08/09/2021

A Concise Function Representation for Faster Exact MPE and Constrained Optimisation in Graphical Models

We propose a novel concise function representation for graphical models,...
10/16/2012

Join-graph based cost-shifting schemes

We develop several algorithms taking advantage of two common approaches ...