Faster Exact MPE and Constrained Optimization with Deterministic Finite State Automata
Abstract
We propose a concise function representation based on deterministic finite state automata for exact most probable explanation and constrained optimization tasks in graphical models. We then exploit our concise representation within Bucket Elimination (BE). We denote our version of BE as FABE. FABE significantly improves the performance of BE in terms of runtime and memory requirements by minimizing redundancy. Indeed, results on most probable explanation and weighted constraint satisfaction benchmarks show that FABE often outperforms the state of the art, leading to significant runtime improvements (up to 2 orders of magnitude in our tests).
Cite
Text
Bistaffa. "Faster Exact MPE and Constrained Optimization with Deterministic Finite State Automata." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/209Markdown
[Bistaffa. "Faster Exact MPE and Constrained Optimization with Deterministic Finite State Automata." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/bistaffa2023ijcai-faster/) doi:10.24963/IJCAI.2023/209BibTeX
@inproceedings{bistaffa2023ijcai-faster,
title = {{Faster Exact MPE and Constrained Optimization with Deterministic Finite State Automata}},
author = {Bistaffa, Filippo},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2023},
pages = {1884-1892},
doi = {10.24963/IJCAI.2023/209},
url = {https://mlanthology.org/ijcai/2023/bistaffa2023ijcai-faster/}
}