MAP estimation via agreement on trees: message-passing and linear programming

@article{Wainwright2005MAPEV,
  title={MAP estimation via agreement on trees: message-passing and linear programming},
  author={M. Wainwright and T. Jaakkola and A. Willsky},
  journal={IEEE Transactions on Information Theory},
  year={2005},
  volume={51},
  pages={3697-3717}
}
We develop and analyze methods for computing provably optimal maximum a posteriori probability (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex combination of tree-structured distributions, we obtain an upper bound on the optimal value of the original problem (i.e., the log probability of the MAP assignment) in terms of the combined optimal values of the tree problems. We prove that this upper bound… Expand
Revisiting MAP Estimation, Message Passing and Perfect Graphs
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
Approximate message-passing inference algorithm
Message Passing for Maximum Weight Independent Set
MAP Estimation, Message Passing, and Perfect Graphs
Convergent and Correct Message Passing Schemes for Optimization Problems over Graphical Models
Dynamic Tree Block Coordinate Ascent
Local approximate inference algorithms
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
A new class of upper bounds on the log partition function
Understanding belief propagation and its generalizations
Convergent Tree-Reweighted Message Passing for Energy Minimization
  • V. Kolmogorov
  • Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2006
Using linear programming to Decode Binary linear codes
Information geometry on hierarchy of probability distributions
  • S. Amari
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 2001
...
1
2
3
4
5
...