资源分类
》 资源 》论文》The Finite Model Theory of Bayesian Networks: Descriptive Complexity

The Finite Model Theory of Bayesian Networks: Descriptive Complexity

2019-11-07 | |  54 |   36 |   0
Abstract We adapt the theory of descriptive complexity to encompass Bayesian networks, so as to quantify the expressivity of Bayesian network specifications based on predicates and quantifiers. We show that Bayesian network specifications that employ firstorder quantification capture the complexity class PP; by allowing quantification over predicates, the resulting Bayesian network specifications capture ...NP each class in the hierarchy PPNP , a result tha does not seem to have equivalent in the literature.1

上一篇：TensorCast: Forecasting Time-Evolving Networks with Contextual Information

下一篇：Orchestrating a Network of Mereotopological Theories: An Abridged Report?

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...