Reintroducing Credal Networks under Epistemic Irrelevance

Jasper De Bock
; Proceedings of the Eighth International Conference on Probabilistic Graphical Models, PMLR 52:123-135, 2016.

Abstract

A credal network under epistemic irrelevance is a generalised version of a Bayesian network that loosens its two main building blocks. On the one hand, the local probabilities do not have to be specified exactly. On the other hand, the assumptions of independence do not have to hold exactly. Conceptually, these credal networks are elegant and useful. However, in practice, they have long remained very hard to work with, both theoretically and computationally. This paper provides a general introduction to this type of credal networks and presents some promising new theoretical developments that were recently proved using sets of desirable gambles and lower previsions. We explain these developments in terms of probabilities and expectations, thereby making them more easily accessible to the Bayesian network community.

Cite this Paper


BibTeX
@InProceedings{pmlr-v52-debock16, title = {Reintroducing Credal Networks under Epistemic Irrelevance}, author = {Jasper De Bock}, booktitle = {Proceedings of the Eighth International Conference on Probabilistic Graphical Models}, pages = {123--135}, year = {2016}, editor = {Alessandro Antonucci and Giorgio Corani and Cassio Polpo Campos}}, volume = {52}, series = {Proceedings of Machine Learning Research}, address = {Lugano, Switzerland}, month = {06--09 Sep}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v52/debock16.pdf}, url = {http://proceedings.mlr.press/v52/debock16.html}, abstract = {A credal network under epistemic irrelevance is a generalised version of a Bayesian network that loosens its two main building blocks. On the one hand, the local probabilities do not have to be specified exactly. On the other hand, the assumptions of independence do not have to hold exactly. Conceptually, these credal networks are elegant and useful. However, in practice, they have long remained very hard to work with, both theoretically and computationally. This paper provides a general introduction to this type of credal networks and presents some promising new theoretical developments that were recently proved using sets of desirable gambles and lower previsions. We explain these developments in terms of probabilities and expectations, thereby making them more easily accessible to the Bayesian network community.} }
Endnote
%0 Conference Paper %T Reintroducing Credal Networks under Epistemic Irrelevance %A Jasper De Bock %B Proceedings of the Eighth International Conference on Probabilistic Graphical Models %C Proceedings of Machine Learning Research %D 2016 %E Alessandro Antonucci %E Giorgio Corani %E Cassio Polpo Campos} %F pmlr-v52-debock16 %I PMLR %J Proceedings of Machine Learning Research %P 123--135 %U http://proceedings.mlr.press %V 52 %W PMLR %X A credal network under epistemic irrelevance is a generalised version of a Bayesian network that loosens its two main building blocks. On the one hand, the local probabilities do not have to be specified exactly. On the other hand, the assumptions of independence do not have to hold exactly. Conceptually, these credal networks are elegant and useful. However, in practice, they have long remained very hard to work with, both theoretically and computationally. This paper provides a general introduction to this type of credal networks and presents some promising new theoretical developments that were recently proved using sets of desirable gambles and lower previsions. We explain these developments in terms of probabilities and expectations, thereby making them more easily accessible to the Bayesian network community.
RIS
TY - CPAPER TI - Reintroducing Credal Networks under Epistemic Irrelevance AU - Jasper De Bock BT - Proceedings of the Eighth International Conference on Probabilistic Graphical Models PY - 2016/08/15 DA - 2016/08/15 ED - Alessandro Antonucci ED - Giorgio Corani ED - Cassio Polpo Campos} ID - pmlr-v52-debock16 PB - PMLR SP - 123 DP - PMLR EP - 135 L1 - http://proceedings.mlr.press/v52/debock16.pdf UR - http://proceedings.mlr.press/v52/debock16.html AB - A credal network under epistemic irrelevance is a generalised version of a Bayesian network that loosens its two main building blocks. On the one hand, the local probabilities do not have to be specified exactly. On the other hand, the assumptions of independence do not have to hold exactly. Conceptually, these credal networks are elegant and useful. However, in practice, they have long remained very hard to work with, both theoretically and computationally. This paper provides a general introduction to this type of credal networks and presents some promising new theoretical developments that were recently proved using sets of desirable gambles and lower previsions. We explain these developments in terms of probabilities and expectations, thereby making them more easily accessible to the Bayesian network community. ER -
APA
De Bock, J.. (2016). Reintroducing Credal Networks under Epistemic Irrelevance. Proceedings of the Eighth International Conference on Probabilistic Graphical Models, in PMLR 52:123-135

Related Material