AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models
Abstract
Compiling graphical models has recently been under intense investigation, especially for probabilistic modeling and processing. We present here a novel data structure for compiling weighted graphical models (in particular, probabilistic models), called AND/OR Multi-Valued Decision Diagram (AOMDD). This is a generalization of our previous work on constraint networks, to weighted models. The AOMDD is based on the frameworks of AND/OR search spaces for graphical models, and Ordered Binary Decision Diagrams (OBDD). The AOMDD is a canonical representation of a graphical model, and its size and compilation time are bounded exponentially by the treewidth of the graph, rather than pathwidth as is known for OBDDs. We discuss a Variable Elimination schedule for compilation, and present the general APPLY algorithm that combines two weighted AOMDDs, and also present a search based method for compilation method. The preliminary experimental evaluation is quite encouraging, showing the potential of the AOMDD data structure.
Cite
Text
Mateescu and Dechter. "AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models." Conference on Uncertainty in Artificial Intelligence, 2007.Markdown
[Mateescu and Dechter. "AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models." Conference on Uncertainty in Artificial Intelligence, 2007.](https://mlanthology.org/uai/2007/mateescu2007uai-multi/)BibTeX
@inproceedings{mateescu2007uai-multi,
title = {{AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models}},
author = {Mateescu, Robert and Dechter, Rina},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2007},
pages = {276-284},
url = {https://mlanthology.org/uai/2007/mateescu2007uai-multi/}
}