S. Aji and R. McEliece (2000). The generalized distributive law. IEEE Transactions on Information Theory, 46(2):325-343.
J. Besag (1974). Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society, Series B, (36):192–236.
J. Darroch, S. Lauritzen, and T. Speed (1980). Markov fields and log-linear interaction models for contingency tables. Annals of Statistics, (8):522–539.
A. Globerson and T. Jaakkola (2007). Approximate inference using conditional entropy decompositions. Proceedings of the 11th International Conference on Artificial Intelligence and Statistics.
A. Globerson and T. Jaakkola (2007). Convergent propagation algorithms with oriented trees. Proceedings of the 23th Conference on Uncertainty in Artificial Intelligence (UAI).
A. Globerson and T. Jaakkola (2007). Fixing max-product: Convergent message passing algorithms for map LP-relaxations. In Advances in Neural Information Processing Systems 21.
A. Ihler (2007). Accuracy bounds for belief propagation. Proceedings of the 23th Conference on Uncertainty in Artificial Intelligence (UAI).
D. Karger and N. Srebro (2001). Learning Markov networks: Maximum bounded tree-width graphs. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA).
J. Kleinberg, E. Tardos (1999). Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS).
V. Kolmogorov and R. Zabih (2004). What energy functions can be minimized via graph cuts?. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 26(2):147-159.
V. Kolmogorov (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10):1568-1583.
V. Kolmogorov and C. Rother (2007). Minimizing nonsubmodular functions with graph cuts - A review”. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 29:1274-1279.
F. Kschischang, B. Frey, and H. Loeliger (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2):498-519.
M. Kumar, V. Kolmogorov, and P. Torr (2007). An analysis of convex relaxations for MAP estimation. In Advances in Neural Information Processing Systems (NIPS). slides
S. Lauritzen and D. Spiegelhalter (1988). Local computation with probabilities on graphical structures and their application to expert systems. J. Roy. Statist. Soc. B, 157–224.
S. Lauritzen, A. Dawid, B. Larsen and H. Leimer (1990). Independence properties of directed Markov fields. Networks, (20):491–505.
P. Ravikumar and J. Lafferty (2004). Variational Chernoff bounds for graphical models. Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI).
P. Ravikumar and J. Lafferty (2006). Quadratic programming relaxations for metric labeling and Markov random field MAP estimation. Proceedings of the Twenty-Third International Conference Machine Learning (ICML).
T. Richardson and R. Urbanke (2001). The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory, 47(2):599-618.
D. Sontag and T. Jaakkola (2007). New outer bounds on the marginal polytope. In Advances in Neural Information Processing Systems (NIPS).
N. Srebro (2003). Maximum likelihood bounded tree-width Markov networks. Artificial Intelligence 143(1):123-138.
M. Wainwright, T. Jaakkola, and A. Willsky (2005). Map estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions on Information Theory, 51(11):3697--3717, 2005.
M. Wainwright, T. Jaakkola, and A. Willsky (2005). A new class of upper bounds on the log partition function. IEEE Transactions on Information Theory, 51:2313--2335.
M. Wainwright and M. Jordan (2003). Graphical models, exponential families, and variational inference. UC Berkeley, Dept. of Statistics, Technical Report 649.
M. Wainwright and M. Jordan (2005). A variational principle for graphical models. In New Directions in Statistical Signal Processing: From Systems to Brain. MIT Press.
M. Wainwright, T. Jaakkola and A. S. Willsky (2001). Tree-based reparameterization framework for analysis of sum-product and related algorithms. IEEE Transactions on Information Theory, 45(9):1120--1146.
Y. Weiss (2000). Correctness of local probability propagation in graphical models with loops. Neural Computation, 12:1–41.
Y. Weiss, C. Yanover and T. Meltzer. MAP estimation, linear programming and belief propagation with convex free energies. Proceedings of the 23th Conference on Uncertainty in Artificial Intelligence (UAI).
T. Werner (2007). A linear programming approach to max-sum problem: A review. IEEE Transactions on Pattern Recognition and Machine Intelligence (PAMI) 29(7):1165-1179.
T. Werner (2007). What is decreased by the max-sum arc consistency algorithm? Proceedings of the Twenty-Four International Conference Machine Learning (ICML).
J. Yedidia, W. Freeman, and Y. Weiss (2005). Constructing free energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51(7):2282-2312.
J. Yedidia, W. Freeman and Y. Weiss (2003). Understanding belief propagation and its generalizations. Exploring Artificial Intelligence in the New Millennium, Chapter 8, 239-236.