Synthesis of strategies in influence diagrams

Manuel Luque, Manuel Arias, Francisco Javier Díez
Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence, PMLR R15:790-798, 2017.

Abstract

Influence diagrams (IDs) are a powerful tool for representing and solving decision problems un- der uncertainty. The objective of evaluating an ID is to compute the expected utility and an opti- mal strategy, which consists of a policy for each decision. Every policy is usually represented as a table containing a column for each decision sce- nario, i.e., for each configuration of the variables on which it depends. The no-forgetting assump- tion, which implies that the decision maker al- ways remembers all past observations and de- cisions, makes the policies grow exponentially with the number of variables in the ID. For hu- man experts it is very difficult to understand the strategy contained in huge policy tables, not only for their size, but also because the vast major- ity of columns correspond to suboptimal or im- possible scenarios and are hence irrelevant. This makes it difficult to extract the rules of action, to debug the model, and to convince the experts that the recommendations of the ID are reasonable. In this paper, we propose a method that presents the strategy in the form of a compact tree. It has been implemented in OpenMarkov, an open- source software tool for probabilistic graphical models. This facility was essential when eval- uating an influence diagram for the mediastinal staging of non-small cell lung cancer; the op- timal strategy, whose biggest policy table con- tained more than 15,000 columns, was synthe- sized into a tree of only 5 leaves.

Cite this Paper


BibTeX
@InProceedings{pmlr-vR15-luque17a, title = {Synthesis of strategies in influence diagrams}, author = {Luque, Manuel and Arias, Manuel and D{\'i}ez, Francisco Javier}, booktitle = {Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence}, pages = {790--798}, year = {2017}, editor = {Elidan, Gal and Kersting, Kristian}, volume = {R15}, series = {Proceedings of Machine Learning Research}, month = {11--15 Aug}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/r15/main/assets/luque17a/luque17a.pdf}, url = {https://proceedings.mlr.press/r15/luque17a.html}, abstract = {Influence diagrams (IDs) are a powerful tool for representing and solving decision problems un- der uncertainty. The objective of evaluating an ID is to compute the expected utility and an opti- mal strategy, which consists of a policy for each decision. Every policy is usually represented as a table containing a column for each decision sce- nario, i.e., for each configuration of the variables on which it depends. The no-forgetting assump- tion, which implies that the decision maker al- ways remembers all past observations and de- cisions, makes the policies grow exponentially with the number of variables in the ID. For hu- man experts it is very difficult to understand the strategy contained in huge policy tables, not only for their size, but also because the vast major- ity of columns correspond to suboptimal or im- possible scenarios and are hence irrelevant. This makes it difficult to extract the rules of action, to debug the model, and to convince the experts that the recommendations of the ID are reasonable. In this paper, we propose a method that presents the strategy in the form of a compact tree. It has been implemented in OpenMarkov, an open- source software tool for probabilistic graphical models. This facility was essential when eval- uating an influence diagram for the mediastinal staging of non-small cell lung cancer; the op- timal strategy, whose biggest policy table con- tained more than 15,000 columns, was synthe- sized into a tree of only 5 leaves.}, note = {Reissued by PMLR on 04 October 2026.} }
Endnote
%0 Conference Paper %T Synthesis of strategies in influence diagrams %A Manuel Luque %A Manuel Arias %A Francisco Javier Díez %B Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence %C Proceedings of Machine Learning Research %D 2017 %E Gal Elidan %E Kristian Kersting %F pmlr-vR15-luque17a %I PMLR %P 790--798 %U https://proceedings.mlr.press/r15/luque17a.html %V R15 %X Influence diagrams (IDs) are a powerful tool for representing and solving decision problems un- der uncertainty. The objective of evaluating an ID is to compute the expected utility and an opti- mal strategy, which consists of a policy for each decision. Every policy is usually represented as a table containing a column for each decision sce- nario, i.e., for each configuration of the variables on which it depends. The no-forgetting assump- tion, which implies that the decision maker al- ways remembers all past observations and de- cisions, makes the policies grow exponentially with the number of variables in the ID. For hu- man experts it is very difficult to understand the strategy contained in huge policy tables, not only for their size, but also because the vast major- ity of columns correspond to suboptimal or im- possible scenarios and are hence irrelevant. This makes it difficult to extract the rules of action, to debug the model, and to convince the experts that the recommendations of the ID are reasonable. In this paper, we propose a method that presents the strategy in the form of a compact tree. It has been implemented in OpenMarkov, an open- source software tool for probabilistic graphical models. This facility was essential when eval- uating an influence diagram for the mediastinal staging of non-small cell lung cancer; the op- timal strategy, whose biggest policy table con- tained more than 15,000 columns, was synthe- sized into a tree of only 5 leaves. %Z Reissued by PMLR on 04 October 2026.
APA
Luque, M., Arias, M. & Díez, F.J.. (2017). Synthesis of strategies in influence diagrams. Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence, in Proceedings of Machine Learning Research R15:790-798 Available from https://proceedings.mlr.press/r15/luque17a.html. Reissued by PMLR on 04 October 2026.

Related Material