Estimation and marginalization using the Kikuchi approximation methods

Neural Computation

Volumn 17, Issue 8, 2005, Pages 1836-1873

  Pakzad, Payam ^a   Anantharam, Venkat ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; BIOPHYSICS; COMPARATIVE STUDY; COMPUTER SIMULATION; HUMAN; PROBABILITY; STATISTICAL MODEL;

ALGORITHMS; BIOPHYSICS; COMPUTER SIMULATION; HUMANS; MODELS, STATISTICAL; NEURAL NETWORKS (COMPUTER); PROBABILITY;

EID: 20744460346     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/0899766054026693     Document Type: Article

References (34)

1. Aji, S., & McEliece, R. (2000). The generalized distributive law. IEEE Trans. Inform. Theory, 46(2), 325-343.
2. Aji, S., & McEliece, R. (2001). The generalized distributive law and free energy minimization. In Proceedings of the Allerton Conference on Communication, Control, and Computing (pp. 672-681). Urbana, IL: University of Illinois.
3. Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo-codes. In Proceedings of the IEEE International Conference on Communications (no. 2, pp. 1064-1070). Piscataway, NJ: IEEE.
4. Cover, T., & Thomas, J. (1991). Elements of information theory. New York: Wiley.
5. Cowell, R., Dawid, A., Lauritzen, S., & Spiegelhalter, D. (1999). Probabilistic networks and expert systems. Berlin: Springer-Verlag.
6. Divsalar, D., Jin, H., & McEliece, R. (1998). Coding theorems for "turbo-like" codes. In Proceedings of the Allerton Conference on Communication, Control, and Computing (pp. 201-210). Urbana, IL: University of Illinois.
7. Federer, H. (1969). Geometric measure theory. Berlin: Springer-Verlag.
8. Gallager, R. (1963). Low-density parity-check codes. Cambridge, MA: MIT Press.
9. Hall, P. (1935). On representatives of subsets. Journal of London Mathematical Society, 10, 26-30.
10. Kikuchi, R. (1951). A theory of cooperative phenomena. Phys. Rev., 6(81), 988-1003.
11. Kittel, C., & Kroemer, H. (1980). Thermal physics. New York: W. H. Freeman.
12. Luby, M. (2002). LT-codes. In Proceedings of IEEE Symposium on the Foundations of Computer Science (pp. 271-280). Piscataway, NJ: IEEE.
13. MacKay, D., & Neal, R. (1995). Good codes based on very sparse matrices. In Cryptography and Coding: 5th IMA Conference (pp. 100-111). Berlin: Springer-Verlag.
14. McEliece, R., MacKay, D., & Cheng, J. (1998). Turbo decoding as an instance of Pearl's "belief propagation" algorithm. IEEE J. Select. Areas Commun., 16(2), 140-152.
15. McEliece, R., & Yildrim, M. (2003). Belief propagation on partially ordered sets. In J. Rosenthal & D. S. Gilliam (Eds.), Mathematical systems theory in biology, communications, computation, and finance (pp. 275-300). Berlin: Springer.
16. Morita, T. (1994). Formal structure of the cluster variation method. Prog. Theor. Phys. Supp., 115, 27-39.
17. Pakzad, P. (2004). Low complexity, high performance algorithms for estimation and decoding. Unpublished doctoral dissertation, University of California, Berkeley.
18. Pakzad, P., & Anantharam, V. (2002a). Belief propagation and statistical physics. In Conference on Information Sciences and Systems (CISS 2002) (Paper No. 225). Princeton, NJ: Princeton University.
19. Pakzad, P., & Anantharam, V. (2002b). Minimal graphical representations of Kikuchi regions. In Proceedings of the Allerton Conference on Communication, Control, and Computing. Piscataway, NJ: IEEE.
20. Pakzad, P., & Anantharam, V. (2004). A new look at the generalized distributive law. IEEE Trans. Inform. Theory, 50(6), 1132-1155.
21. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Mateo, CA: Morgan Kaufmann.
22. Richardson, T. (2000). The geometry of turbo-decoding dynamics. IEEE Trans. Inform. Theory, 46(1), 9-23.
23. Richardson, T., Shokrollahi, A., & Urbanke, R. (2001). Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inform. Theory, 47(2), 619-637.
24. Richardson, T., & Urbanke, R. (2001). The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory, 47(2), 599-618.
25. Stanley, R. (1986). Enumerative combinatorics (Vol. 1). Monterey, CA: Wadsworth & Brooks/Cole.
26. Tanner, R. (1981). A recursive approach to low complexity codes. IEEE Trans. Inform. Theory, 27(9), 533-547.
27. Wainwright, M., & Jordan, M. (2003). Graphical models, exponential families, and variational inference (Tech. Rep. 649). Berkeley: Department of Statistics, University of California.
28. Walrand, J., & Varaiya, P. (1996). High-performance communication networks. San Francisco: Morgan Kaufmann.
29. Weiss, Y. (2000). Correctness of local probability propagation in graphical models with loops. Neural Computation, 12, 1-41.
30. Welling, M., & Teh, Y. (2001). Belief optimization for binary networks: A stable alternative to loopy belief propagation. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence (pp. 554-561). San Francisco: Morgan Kaufmann.
31. Wicker, S. (1995). Error control systems for digital communication and storage. Upper Saddle River, NJ: Prentice Hall.
32. Yedidia, J., Freeman, W., & Weiss, Y. (2001). Bethe free energy, Kikuchi approximations, and belief propagation algorithms (Tech. Rep. TR2001-16). Cambridge, MA: Mitsubishi Electric Research Lab.
33. Yedidia, J., Freeman, W., & Weiss, Y. (2002). Constructing free energy approximations and generalized belief propagation algorithms (Tech. Rep. TR2002-35). Cambridge, MA: Mitsubishi Electric Research Lab.
34. Yuille, A. (2002). CCCP algorithms to minimize the Bethe and Kikuchi free energies: Convergent alternatives to belief propagation. Neural Computation, 14, 1691-1722.