Learning Structured Decision Problems with Unawareness
Abstract
Structured models of decision making often assume an agent is aware of all possible states and actions in advance. This assumption is sometimes untenable. In this paper, we learn Bayesian Decision Networks from both domain exploration and expert assertions in a way which guarantees convergence to optimal behaviour, even when the agent starts unaware of actions or belief variables that are critical to success. Our experiments show that our agent learns optimal behaviour on both small and large decision problems, and that allowing an agent to conserve information upon making new discoveries results in faster convergence.
Cite
Text
Innes and Lascarides. "Learning Structured Decision Problems with Unawareness." International Conference on Machine Learning, 2019.Markdown
[Innes and Lascarides. "Learning Structured Decision Problems with Unawareness." International Conference on Machine Learning, 2019.](https://mlanthology.org/icml/2019/innes2019icml-learning/)BibTeX
@inproceedings{innes2019icml-learning,
title = {{Learning Structured Decision Problems with Unawareness}},
author = {Innes, Craig and Lascarides, Alex},
booktitle = {International Conference on Machine Learning},
year = {2019},
pages = {2941-2950},
volume = {97},
url = {https://mlanthology.org/icml/2019/innes2019icml-learning/}
}