A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models.
Lars OttenRina DechterPublished in: UAI (2012)
Keyphrases
- graphical models
- branch and bound
- mini bucket
- lower bound
- branch and bound algorithm
- belief propagation
- search algorithm
- search space
- probabilistic model
- depth first search
- probabilistic graphical models
- column generation
- approximate inference
- probabilistic inference
- bayesian networks
- random variables
- combinatorial optimization
- upper bound
- conditional random fields
- optimal solution
- branch and bound procedure
- markov networks
- conditional independence
- factor graphs
- map inference
- structure learning
- tree search
- belief networks
- computational complexity
- markov random field
- objective function
- multi valued decision diagrams
- statistical relational learning
- message passing
- decision problems
- parameter estimation