Adaptive Tree CPDs in Max-Product Belief Propagation

Abstract

In general, the problem of computing the maximum a posteriori (MAP) assignment in a Bayesian network is computationally intractable. In some cases, such as in tree-structured networks, inference can be done efficiently and exactly. However, there are still practical challenges when trying to do inference in networks containing variables with large… (More)

3 Figures and Tables

Topics

  • Presentations referencing similar topics