{"type":"ScholarlyArticle","title":"Faster Exact MPE and Constrained Optimization with Deterministic Finite State Automata","authors":[{"name":"Filippo Bistaffa","slug":"filippo-bistaffa","given":"Filippo","family":"Bistaffa","affiliation":"IIIA-CSIC"}],"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).","doi":"10.24963/ijcai.2023/209","url":"https://ijcai.org/proceedings/2023/209","pdf":"https://ijcai.org/proceedings/2023/0209.pdf","markdown":"https://ijcai.org/proceedings/2023/209.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/209","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":209,"pages":{"first":1884,"last":1892},"keywords":["Uncertainty in AI: UAI: Graphical models","Constraint Satisfaction and Optimization: CSO: Constraint optimization"],"videos":[],"references":[{"position":1,"raw":"[Bahar et al., 1997] Iris Bahar, Erica Frohm, Charles Gaona, Gary Hachtel, Enrico Macii, Abelardo Pardo, and Fabio Somenzi. Algebric decision diagrams and their applications. Formal Methods in System Design, 10(2):171-206, 1997.","title":"Algebric decision diagrams and their applications","authors":"Bahar","year":"1997","venue":"Formal Methods in System Design","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bensana et al., 1999] Eric Bensana, Michel Lemaitre, and Gerard Verfaillie. Earth observation satellite management. Constraints, 4(3):293-299, 1999.","title":"Earth observation satellite management","authors":"Eric Bensana, Michel Lemaitre, Gerard Verfaillie","year":"1999","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bistaffa and Farinelli, 2018] Filippo Bistaffa and Alessan- dro Farinelli. A COP model for graph-constrained coali- tion formation. Journal of Artificial Intelligence Research, 62:133-153, 2018.","title":"A COP model for graph-constrained coalition formation","authors":"Filippo Bistaffa, Alessandro Farinelli","year":"2018","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bistaffa et al., 2017] Filippo Bistaffa, Nicola Bombieri, and Alessandro Farinelli. An efficient approach for accelerat- ing bucket elimination on GPUs. IEEE Transactions on Cybernetics, 47(11):3967-3979, 2017.","title":"An efficient approach for accelerating bucket elimination on GPUs","authors":"Filippo Bistaffa, Nicola Bombieri, Alessandro Farinelli","year":"2017","venue":"IEEE Transactions on Cybernetics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bubenzer, 2011] Johannes Bubenzer. Minimization of acyclic DFAs. In Prague Stringology Conference, pages 132-146, 2011.","title":"Minimization of acyclic DFAs","authors":"Johannes Bubenzer, Bubenzer","year":"2011","venue":"Prague Stringology Conference","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chavira and Darwiche, 2007] Mark Chavira and Adnan Dar- wiche. Compiling Bayesian networks using variable elim- ination. In International Joint Conference on Artificial Intelligence (IJCAI), pages 2443-2449, 2007.","title":"Compiling Bayesian networks using variable elimination","authors":"Darwiche Chavira","year":"2007","venue":"International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Daciuk, 2002] Jan Daciuk. Comparison of construction al- gorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings. In International Conference on Implementation and Application of Automata, pages 255-261, 2002.","title":"Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings","authors":"Jan Daciuk","year":"2002","venue":"International Conference on Implementation and Application of Automata","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dechter, 1996] Rina Dechter. Bucket elimination: A unify- ing framework for probabilistic inference. In Conference on Uncertainty in Artificial Intelligence (UAI), pages 211-219, 1996.","title":"Bucket elimination: A unifying framework for probabilistic inference","authors":"Rina Dechter","year":"1996","venue":"Conference on Uncertainty in Artificial Intelligence (UAI)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dechter, 1997] Rina Dechter. Mini-buckets: A general scheme for generating approximations in automated rea- soning. In International Joint Conference on Artificial Intelligence (IJCAI), pages 1297-1303, 1997.","title":"Mini-buckets: A general scheme for generating approximations in automated reasoning","authors":"Rina Dechter","year":"1997","venue":"International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dechter, 2013] Rina Dechter. Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2013.","title":"Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms","authors":"Rina Dechter","year":"2013","venue":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Demeulenaere et al., 2016] Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, and Pierre Schaus. Compact- table: efficiently filtering table constraints with reversible sparse bit-sets. In International Conference on Principles and Practice of Constraint Programming (CP), pages 207- 223. Springer, 2016.","title":"Compacttable: efficiently filtering table constraints with reversible sparse bit-sets","authors":"Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus","year":"2016","venue":"International Conference on Principles and Practice of Constraint Programming (CP)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fishelson and Geiger, 2002] Maáyan Fishelson and Dan Geiger. Exact genetic linkage computations for general pedigrees. Bioinformatics, 18(suppl 1):S189-S198, 2002.","title":"Exact genetic linkage computations for general pedigrees","authors":"Geiger Fishelson, Maáyan Fishelson, Dan Geiger","year":"2002","venue":"Bioinformatics","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gogate and Domingos, 2013] Vibhav Gogate and Pedro Domingos. Structured message passing. In Conference on Uncertainty in Artificial Intelligence (UAI), page 252-261, 2013.","title":"Vibhav Gogate and Pedro Domingos. Structured message passing","authors":"Domingos Gogate","year":"2013","venue":"Conference on Uncertainty in Artificial Intelligence (UAI)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Han and Salomaa, 2008] Yo-Sub Han and Kai Salomaa. State complexity of union and intersection of finite lan- guages. International Journal of Foundations of Computer Science, 19(03):581-595, 2008.","title":"Yo-Sub Han and Kai Salomaa. State complexity of union and intersection of finite languages","authors":"Salomaa Han","year":"2008","venue":"International Journal of Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Higham, 2002] Nicholas Higham. Accuracy and Stability of Numerical Algorithms. Siam, 2002.","title":"Accuracy and Stability of Numerical Algorithms","authors":"Nicholas Higham","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hopcroft and Ullman, 1979] John Hopcroft and Jeffrey Ull- man. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.","title":"Introduction to Automata Theory, Languages and Computation","authors":"Ullman Hopcroft","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hurley et al., 2016] Barry Hurley, Barry O'Sullivan, David Allouche, George Katsirelos, Thomas Schiex, Matthias Zytnicki, and Simon De Givry. Multi-language evaluation of exact solvers in graphical model discrete optimization. Constraints, 21(3):413-434, 2016.","title":"Multi-language evaluation of exact solvers in graphical model discrete optimization","authors":"Barry Hurley, O' Barry, David Sullivan, George Allouche, Thomas Katsirelos, Matthias Schiex, Simon Zytnicki, Givry De","year":"2016","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kersting, 2012] Kristian Kersting. Lifted probabilistic infer- ence. In European Conference on Artificial Intelligence (ECAI), pages 33-38, 2012.","title":"Lifted probabilistic inference","authors":"Kristian Kersting","year":"2012","venue":"European Conference on Artificial Intelligence (ECAI)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kishimoto and Marinescu, 2014] Akihiro Kishimoto and Radu Marinescu. Recursive best-first AND/OR search for optimization in graphical models. In Conference on Uncertainty in Artificial Intelligence (UAI), pages 400-409, 2014.","title":"Recursive best-first AND/OR search for optimization in graphical models","authors":"Marinescu Kishimoto, Akihiro Kishimoto, Radu Marinescu","year":"2014","venue":"Conference on Uncertainty in Artificial Intelligence (UAI)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kishimoto et al., 2015] Akihiro Kishimoto, Radu Mari- nescu, and Adi Botea. Parallel recursive best-first AND/OR search for exact MAP inference in graphical models. In Conference on Neural Information Processing Systems (NeurIPS), pages 928-936, 2015.","title":"Parallel recursive best-first AND/OR search for exact MAP inference in graphical models","authors":"Akihiro Kishimoto, Radu Marinescu, Adi Botea","year":"2015","venue":"Conference on Neural Information Processing Systems (NeurIPS)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lauritzen, 1996] Steffen Lauritzen. Graphical models. Clarendon Press, 1996.","title":"Graphical models","authors":"Steffen Lauritzen","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Marinescu and Dechter, 2007] Radu Marinescu and Rina Dechter. Best-first AND/OR search for graphical mod- els. In AAAI Conference on Artificial Intelligence (AAAI), pages 1171-1176, 2007.","title":"Best-first AND/OR search for graphical models","authors":"Radu Marinescu, Rina Dechter","year":"2007","venue":"AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Marinescu and Dechter, 2009] Radu Marinescu and Rina Dechter. AND/OR branch-and-bound search for combinato- rial optimization in graphical models. Artificial Intelligence, 173(16-17):1457-1491, 2009.","title":"AND/OR branch-and-bound search for combinatorial optimization in graphical models","authors":"Radu Marinescu, Rina Dechter","year":"2009","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mateescu et al., 2008] Robert Mateescu, Rina Dechter, and Radu Marinescu. AND/OR multi-valued decision diagrams (AOMDDs) for graphical models. Journal of Artificial Intelligence Research, 33:465-519, 2008.","title":"AND/OR multi-valued decision diagrams (AOMDDs) for graphical models","authors":"Robert Mateescu, Rina Dechter, Radu Marinescu","year":"2008","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Pearl, 1989] Judea Pearl. Probabilistic Reasoning in Intelli- gent Systems. Morgan Kaufmann, 1989.","title":"Judea Pearl. Probabilistic Reasoning in Intelligent Systems","authors":"Pearl","year":"1989","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Sanner and McAllester, 2005] Scott Sanner and David McAllester. Affine algebraic decision diagrams (AADDs) and their application to structured probabilistic inference. In International Joint Conference on Artificial Intelligence (IJCAI), pages 1384-1390, 2005.","title":"Affine algebraic decision diagrams (AADDs) and their application to structured probabilistic inference","authors":"Scott Sanner, David Mcallester","year":"2005","venue":"International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Srinivasan et al., 1990] Arvind Srinivasan, Timothy Ham, Sharad Malik, and Robert Brayton. Algorithms for dis- crete function manipulation. In International Conference on Computer-Aided Design (ICCAD), pages 92-93, 1990.","title":"Algorithms for discrete function manipulation","authors":"Arvind Srinivasan, Timothy Ham, Sharad Malik, Robert Brayton","year":"1990","venue":"International Conference on Computer-Aided Design (ICCAD)","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Yanover et al., 2008] Chen Yanover, Ora Schueler-Furman, and Yair Weiss. Minimizing and learning energy func- tions for side-chain prediction. Journal of Computational Biology, 15(7):899-911, 2008.","title":"Minimizing and learning energy functions for side-chain prediction","authors":"Chen Yanover, Ora Schueler-Furman, Yair Weiss","year":"2008","venue":"Journal of Computational Biology","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}