BEEM : Bucket Elimination with External Memory
Abstract
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.
Cite
Text
Kask et al. "BEEM : Bucket Elimination with External Memory." Conference on Uncertainty in Artificial Intelligence, 2010.Markdown
[Kask et al. "BEEM : Bucket Elimination with External Memory." Conference on Uncertainty in Artificial Intelligence, 2010.](https://mlanthology.org/uai/2010/kask2010uai-beem/)BibTeX
@inproceedings{kask2010uai-beem,
title = {{BEEM : Bucket Elimination with External Memory}},
author = {Kask, Kalev and Dechter, Rina and Gelfand, Andrew},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2010},
pages = {268-276},
url = {https://mlanthology.org/uai/2010/kask2010uai-beem/}
}