Tightening LP Relaxations for MAP using Message Passing

Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved eciently using message-passing algorithms such as belief propagation and, when the re- laxation is tight, provably find the MAP con- figuration. The standard LP relaxation is...更多