Year: 2012
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Kask, Kalev, Dechter, Rina, Gelfand, Andrew E.
Institutions: University of California, Irvine, Irvine University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1552227334
