Proceedings

Deep Bucket Elimination

Download BibTeX Cite

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. Main Track. Pages 4235-4242.

https://doi.org/10.24963/ijcai.2021/582

Abstract

Bucket Elimination (BE) is a universal inference scheme that can solve most tasks over probabilistic and deterministic graphical models exactly.

However, it often requires exponentially high levels of memory (in the induced-width) preventing its execution. In the spirit of exploiting Deep Learning for inference tasks, in this paper, we will use neural networks to approximate BE.

The resulting Deep Bucket Elimination (DBE) algorithm is developed for computing the partition function.

We provide a proof-of-concept empirically using instances from several different benchmarks, showing that DBE can be a more accurate approximation than current state-of-the-art approaches for approximating BE (e.g. the mini-bucket schemes), especially when problems are sufficiently hard.

Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, and Rina Dechter. 2021. Deep Bucket Elimination. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. IJCAI, 4235–4242. https://doi.org/10.24963/ijcai.2021/582
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards