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.
Paper
References (15)
10And/or search spaces for graphical models2007 · Artif. Intell.
12We assume that each thread uses the same amount of memory and that the memory allocated to a thread remains (cid:28)xed throughout the algorithm’s execution
Scroll for more · 3 remaining