DeepAI AI Chat
Log In Sign Up

Join-graph based cost-shifting schemes

by   Alexander T. Ihler, et al.

We develop several algorithms taking advantage of two common approaches for bounding MPE queries in graphical models: minibucket elimination and message-passing updates for linear programming relaxations. Both methods are quite similar, and offer useful perspectives for the other; our hybrid approaches attempt to balance the advantages of each. We demonstrate the power of our hybrid algorithms through extensive empirical evaluation. Most notably, a Branch and Bound search guided by the heuristic function calculated by one of our new algorithms has recently won first place in the PASCAL2 inference challenge.


page 1

page 2

page 3

page 4


The Relationship Between AND/OR Search and Variable Elimination

In this paper we compare search and inference in graphical models throug...

MAP Estimation, Message Passing, and Perfect Graphs

Efficiently finding the maximum a posteriori (MAP) configuration of a gr...

Discrete graphical models – an optimization perspective

This monograph is about discrete energy minimization for discrete graphi...

Bayesian Inference in Cumulative Distribution Fields

One approach for constructing copula functions is by multiplication. Giv...

BEEM : Bucket Elimination with External Memory

A major limitation of exact inference algorithms for probabilistic graph...

Iterative Join-Graph Propagation

The paper presents an iterative version of join-tree clustering that app...

Hypertree Decompositions Revisited for PGMs

We revisit the classical problem of exact inference on probabilistic gra...