An edge deletion semantics for belief propagation and its practical impact on approximation quality

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1107-1114

  Choi, Arthur ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COST; EDGE DELETION SEMANTICS; ITERATIVE BELIEF PROPAGATION;

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; INFERENCE ENGINES; ITERATIVE METHODS; PARAMETER ESTIMATION; TREES (MATHEMATICS);

SEMANTICS;

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

References (20)

1. Aji, S. M., and McEliece, R. J. 2001. The generalized distributive law and free energy minimization. In Proceedings of the 39th Allerton Conference on Communication, Control and Computing, 672-681.
2. Chan, H., and Darwiche, A. 2005. On the revision of probabilistic beliefs using uncertain evidence. Artificial Intelligence 163:67-90.
3. Chavira, M., and Darwiche, A. 2005. Compiling Bayesian networks with local structure. In IJCAI, 1306-1312.
4. Choi, A., and Darwiche, A. 2006. A variational approach for approximating Bayesian networks by edge deletion. Technical Report D-149, Computer Science Department, UCLA.
5. Choi, A.; Chan, H.; and Darwiche, A. 2005. On Bayesian network approximation by edge deletion. In UAI, 128-135.
6. Darwiche, A. 2001. Recursive conditioning. Artificial Intelligence 126(1-2):5-41.
7. Dechter, R.; Kask, K.; and Mateescu, R. 2002. Iterative join-graph propagation. In UAI, 128-136.
8. Dechter, R. 1996. Bucket elimination: A unifying framework for probabilistic inference. In UAI, 211-219.
9. Frey, B. J., and MacKay, D. J. C. 1997. A revolution: Belief propagation in graphs with cycles. In NIPS, 479-485.
10. Jensen, F. V.; Lauritzen, S.; and Olesen, K. 1990. Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly 4:269-282.
11. Lauritzen, S. L., and Spiegelhalter, D. J. 1988. Local computations with probabilities on graphical structures and their application to expert systems. Journal of Royal Statistics Society, Series B 50(2): 157-224.
12. Minka, T. P. 2001. A family of algorithms for approximate Bayesian inference. Ph.D. Dissertation, MIT.
13. Murphy, K. P.; Weiss, Y.; and Jordan, M. I. 1999. Loopy belief propagation for approximate inference: An empirical study. In UAI, 467-475.
14. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo, California.
15. Tappen, M. F., and Freeman, W. T. 2003. Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. In ICCV, 900-907.
16. Wainwright, M. J.; Jaakkola, T.; and Willsky, A. S. 2003. Tree-based reparameterization framework for analysis of sum-product and related algorithms. IEEE Transactions on Information Theory 49(5); 1120-1146.
17. Welling, M.; Minka, T. P.; and Teh, Y. W. 2005. Structured region graphs: morphing EP into GBP. In UAI.
18. Welling, M. 2004. On the choice of regions for generalized belief propagation. In UAI, 585. Arlington, Virginia: AUAI Press.
19. Yedidia, J.; Freeman, W.; and Weiss, Y. 2005. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory 51(7):2282-2312.
20. Zhang, N. L., and Poole, D. 1996. Exploiting causal independence in Bayesian network inference. JAIR 5:301-328.