Tree-based reparameterization for approximate inference on loopy graphs

Advances in Neural Information Processing Systems

Volumn , Issue , 2002, Pages

  Wainwright , Martin J ^a   Jaakkola, Tommi ^a   Willsky, Alan S ^a  

^a USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE INFERENCE; BELIEF PROPAGATION; BETHE FREE ENERGY; CONVERGENCE PROPERTIES; EXACT COMPUTATIONS; ITERATIVE ALGORITHM; NATURAL EXTENSION; REPARAMETERIZATION;

ALGORITHMS;

EID: 2942655074     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. J. Yedidia, W. T. Freeman, and Y. Weiss. Generalized belief propagation. In NIPS 13, pages 689-695. MIT Press, 2001.
2. T. P. Minka. A family of algorithms for approximate Bayesian inference. PhD thesis, MIT Media Lab, 2001.
3. J. Pearl. Probabilistic reasoning in intelligent systems. Morgan Kaufman, San Mateo, 1988.
4. F. Kschischang and B. Frey. Iterative decoding of compound codes by probability propagation in graphical models. IEEE Sel. Areas Comm., 16(2):219-230, February 1998.
5. J. B. Anderson and S. M. Hladnik. Tailbiting map decoders. IEEE Sel. Areas Comm., 16:297-302, February 1998.
6. Y. Weiss. Correctness of local probability propagation in graphical models with loops. Neural Computation, 12:1-41, 2000.
7. Y. Weiss and W. T. Freeman. Correctness of belief propagation in Gaussian graphical models of arbitrary topology. In NIPS 12, pages 673-679. MIT Press, 2000.
8. P. Rusmevichientong and B. Van Roy. An analysis of turbo decoding with Gaussian densities. In NIPS 12, pages 575-581. MIT Press, 2000.
9. T. Richardson. The geometry of turbo-decoding dynamics. IEEE Trans. Info. Theory, 46(1):9-23, January 2000.
10. R. Kikuchi. The theory of cooperative phenomena. Physical Review, 81:988-1003, 1951.
11. M. Welling and Y. Teh. Belief optimization: A stable alternative to loopy belief propagation. In Uncertainty in Artificial Intelligence, July 2001.
12. A. Yuille. A double-loop algorithm to minimize the Bethe and Kikuchi free energies. Neural Computation, To appear, 2001.
13. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree-based reparameterization for approximate estimation on graphs with cycles. LIDS Tech. report P-2510: available at http://ssg.mit.edu/groiip/mjwaiii/mjwaiii.slitml May 2001.
14. M. Wainwright. Stochastic processes on graphs with cycles: geometric and variational approaches. PhD thesis, MIT, Laboratory for Information and Decision Systems, January 2002.
15. S. L. Lauritzen. Graphical models. Oxford University Press, Oxford, 1996.
16. W. Freeman and Y. Weiss. On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Trans. Info. Theory, 47:736-744, 2001.