Sum-Product-Max Networks for Tractable Decision Making
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 1846-1851.
Abstract
Investigations into probabilistic graphical models for decision making have predominantly centered on influence diagrams (IDs) and decision circuits (DCs) for representation and computation of decision rules that maximize expected utility. Since IDs are typically handcrafted and DCs are compiled from IDs, in this paper we propose an approach to learn the structure and parameters of decision-making problems directly from data. We present a new representation called sum-product-max network (SPMN) that generalizes a sum-product network (SPN) to the class of decision-making problems and whose solution, analogous to DCs, scales linearly in the size of the network. We show that SPMNs may be reduced to DCs linearly and present a first method for learning SPMNs from data. This approach is significant because it facilitates a novel paradigm of tractable decision making driven by data.
@inproceedings{ijcai2016p264,
title = {Sum-Product-Max Networks for Tractable Decision Making},
author = {Melibari, Mazen and Poupart, Pascal and Doshi, Prashant},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {1846--1851},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/264},
}
TY - CPAPER TI - Sum-Product-Max Networks for Tractable Decision Making AU - Melibari, Mazen AU - Poupart, Pascal AU - Doshi, Prashant T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 1846 EP - 1851 UR - https://ijcai.org/proceedings/2016/264 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: