Tree consistency and bounds on the performance of the max-product algorithm and its generalizations

  title={Tree consistency and bounds on the performance of the max-product algorithm and its generalizations},
  author={Martin J. Wainwright and Tommi S. Jaakkola and Alan S. Willsky},
  journal={Statistics and Computing},
Finding the maximum a posteriori (MAP) assignment of a discrete-state distribution specified by a graphical model requires solving an integer program. The max-product algorithm, also known as the max-plus or min-sum algorithm, is an iterative method for (approximately) solving such a problem on graphs with cycles. We provide a novel perspective on the algorithm, which is based on the idea of reparameterizing the distribution in terms of so-called pseudo-max-marginals on nodes and edges of the… CONTINUE READING
Highly Cited
This paper has 136 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 81 extracted citations

137 Citations

Citations per Year
Semantic Scholar estimates that this publication has 137 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 44 references

Applications of a general propagation algorithm for probabilistic expert systems

  • A. P. Dawid
  • Statistics and Computing 2: 25–36.
  • 1992
Highly Influential
10 Excerpts

On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs

  • W. T. Freeman, Y. Weiss
  • IEEE Trans. Info. Theory 47: 736–744.
  • 2001
Highly Influential
18 Excerpts

Modern Graph Theory

  • B. Bollobás
  • Springer-Verlag, New York.
  • 1998
Highly Influential
5 Excerpts

Iterative decoding and pseudocodewords

  • G. Horn
  • PhD thesis, California Institute of Technology.
  • 1999
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…