资源分类
》 资源 》论文》The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages

The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages

2019-11-21 | |  85 |   59 |   0
Abstract We study the computational complexity of finding maximum a posteriori configurations in Bayesian networks whose probabilities are specified by logical formulas. This approach leads to a fine grained study in which local information such as contextsensitive independence and determinism can be considered. It also allows us to characterize more precisely the jump from tractability to NP-hardness and beyond, and to consider the complexity introduced by evidence alone.

上一篇：Personalizing Product Rankings Using Collaborative Filtering on Opinion-Derived Topic Profiles

下一篇：Dissecting German Grammar and Swiss Passports: Open-Domain Decomposition of Compositional Entries in Large-Scale Knowledge Repositories

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • 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...