A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations

Charupriya Sharma, Zhenyu A. Liao, James Cussens, Peter Beek
Proceedings of the 10th International Conference on Probabilistic Graphical Models, PMLR 138:413-424, 2020.

Abstract

A Bayesian network is a probabilistic graphical model that consists of a directed acyclic graph (DAG), where each node is a random variable and attached to each node is a conditional probability distribution (CPD). A Bayesian network can be learned from data using the well-known score-and-search approach, and within this approach a key consideration is how to simultaneously learn the global structure in the form of the underlying DAG and the local structure in the CPDs. Several useful forms of local structure have been identified in the literature but thus far the score-and-search approach has only been extended to handle local structure in form of context-specific independence. In this paper, we show how to extend the score-and-search approach to the important and widely useful case of noisy-OR relations. We provide an effective gradient descent algorithm to score a candidate noisy-OR using the widely used BIC score and we provide pruning rules that allow the search to successfully scale to medium sized networks. Our empirical results provide evidence for the success of our approach to learning Bayesian networks that incorporate noisy-OR relations.

Cite this Paper


BibTeX
@InProceedings{pmlr-v138-sharma20a, title = {A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations}, author = {Sharma, Charupriya and Liao, Zhenyu A. and Cussens, James and van Beek, Peter}, booktitle = {Proceedings of the 10th International Conference on Probabilistic Graphical Models}, pages = {413--424}, year = {2020}, editor = {Manfred Jaeger and Thomas Dyhre Nielsen}, volume = {138}, series = {Proceedings of Machine Learning Research}, month = {23--25 Sep}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v138/sharma20a/sharma20a.pdf}, url = { http://proceedings.mlr.press/v138/sharma20a.html }, abstract = {A Bayesian network is a probabilistic graphical model that consists of a directed acyclic graph (DAG), where each node is a random variable and attached to each node is a conditional probability distribution (CPD). A Bayesian network can be learned from data using the well-known score-and-search approach, and within this approach a key consideration is how to simultaneously learn the global structure in the form of the underlying DAG and the local structure in the CPDs. Several useful forms of local structure have been identified in the literature but thus far the score-and-search approach has only been extended to handle local structure in form of context-specific independence. In this paper, we show how to extend the score-and-search approach to the important and widely useful case of noisy-OR relations. We provide an effective gradient descent algorithm to score a candidate noisy-OR using the widely used BIC score and we provide pruning rules that allow the search to successfully scale to medium sized networks. Our empirical results provide evidence for the success of our approach to learning Bayesian networks that incorporate noisy-OR relations.} }
Endnote
%0 Conference Paper %T A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations %A Charupriya Sharma %A Zhenyu A. Liao %A James Cussens %A Peter Beek %B Proceedings of the 10th International Conference on Probabilistic Graphical Models %C Proceedings of Machine Learning Research %D 2020 %E Manfred Jaeger %E Thomas Dyhre Nielsen %F pmlr-v138-sharma20a %I PMLR %P 413--424 %U http://proceedings.mlr.press/v138/sharma20a.html %V 138 %X A Bayesian network is a probabilistic graphical model that consists of a directed acyclic graph (DAG), where each node is a random variable and attached to each node is a conditional probability distribution (CPD). A Bayesian network can be learned from data using the well-known score-and-search approach, and within this approach a key consideration is how to simultaneously learn the global structure in the form of the underlying DAG and the local structure in the CPDs. Several useful forms of local structure have been identified in the literature but thus far the score-and-search approach has only been extended to handle local structure in form of context-specific independence. In this paper, we show how to extend the score-and-search approach to the important and widely useful case of noisy-OR relations. We provide an effective gradient descent algorithm to score a candidate noisy-OR using the widely used BIC score and we provide pruning rules that allow the search to successfully scale to medium sized networks. Our empirical results provide evidence for the success of our approach to learning Bayesian networks that incorporate noisy-OR relations.
APA
Sharma, C., Liao, Z.A., Cussens, J. & Beek, P.. (2020). A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations. Proceedings of the 10th International Conference on Probabilistic Graphical Models, in Proceedings of Machine Learning Research 138:413-424 Available from http://proceedings.mlr.press/v138/sharma20a.html .

Related Material