Join-graph propagation algorithms

Journal of Artificial Intelligence Research

Volumn 37, Issue , 2010, Pages 279-328

  Mateescu, Robert ^a   Kask, Kalev ^b   Gogate, Vibhav ^c   Dechter, Rina ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b Ringgold Standard Institution Informatics   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; BELIEF PROPAGATION; BELIEF PROPAGATION ALGORITHM; CONSTRAINT PROPAGATION; GENERALIZED BELIEF PROPAGATION; ITERATIVE SCHEMES; PARAMETERIZED; PROPAGATION ALGORITHM; STATE-OF-THE-ART ALGORITHMS; STATISTICAL PHYSICS;

BACKPROPAGATION; INFERENCE ENGINES; MESSAGE PASSING;

CLUSTERING ALGORITHMS;

EID: 77952699200     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2842     Document Type: Article

References (63)

1. Arnborg, S. A. (1985). Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25, 2-23.
2. Bacchus, F., Dalmao, S., & Pitassi, T. (2003). Value elimination: Bayesian inference via backtracking search. In Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03), pp. 20-28.
3. Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding: Turbo codes. In Proceedings of the 1993 International Conference on Communications, pp. 1064-1070.
4. Bilmes, J., & Dechter, R. (2006). Evaluation of probabilistic inference systems in UAI'06. http://ssli.ee.washington.edu/ bilmes/ uai06InferenceEvaluation/.
5. Braunstein, A., Mézard, M., & Zecchina, R. (2005). Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms, 27(2), 201-226.
6. Chavira, M., & Darwiche, A. (2008). On probabilistic inference by weighted model counting. Artificial Intelligence, 172(6-7), 772-799.
7. Chavira, M. D., Darwiche, A., & Jaeger, M. (2006). Compiling relational bayesian networks for exact inference. International Journal of Approximate Reasoning, 42(1-2), 4-20.
8. Chertkov, M., & Chernyak, V. Y. (2006). Loop series for discrete statistical models on graphs. Journal of Statistical Mechanics: Theory and Experiment, P6009.
9. Choi, A., Chavira, M., & Darwiche, A. (2007). Node splitting: A scheme for generating upper bounds in bayesian networks. In Proceedings of the Twenty Third Conference on Uncertainty in Artificial Intelligence (UAI'07), pp. 57-66.
10. Choi, A., & Darwiche, A. (2006a). An edge deletion semantics for belief propagation and its practical impact on approximation quality. In Proceedings of the The Twenty-First National Conference on Artificial Intelligence (AAAI'06), pp. 1107-1114.
11. Choi, A., & Darwiche, A. (2006b). A variational approach for approximating bayesian networks by edge deletion. In Proceedings of the Twenty Second Conference on Uncertainty in Artificial Intelligence (UAI'06), pp. 80-89.
12. Cooper, G. F. (1990). The computational complexity of probabistic inferences. Artificial Intelligence, 42, 393-405.
13. Dagum, P., & Luby, M. (1993). Approximating probabilistic inference in bayesian belief networks is NP-hard. Artificial Intelligence, 60(1), 141-153.
14. Darwiche, A. (2001). Recursive conditioning. Artificial Intelligence, 125(1-2), 5-41.
15. Dechter, R. (1992). Constraint networks. Encyclopedia of Artificial Intelligence, 276-285.
16. Dechter, R. (1996). Bucket elimination: A unifying framework for probabilistic inference algorithms. In Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI'96), pp. 211-219.
17. Dechter, R. (1999). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113, 41-85.
18. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann Publishers.
19. Dechter, R., Bidyuk, B., Mateescu, R., & Rollon, E. (2010). The power of belief propagation: A constraint propagation perspective. In Dechter, R., Geffner, H., & Halpern, J. (Eds.), Heuristics, Probabilities and Causality: A Tribute to Judea Pearl.
20. Dechter, R., Kask, K., & Larrosa, J. (2001). A general scheme for multiple lower bound computation in constraint optimization. In Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP'01), pp. 346-360.
21. Dechter, R., Kask, K., & Mateescu, R. (2002). Iterative join-graph propagation. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI'02), pp. 128-136.
22. Dechter, R., & Mateescu, R. (2003). A simple insight into iterative belief propagation's success. In Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03), pp. 175-183.
23. Dechter, R., & Mateescu, R. (2007). AND/OR search spaces for graphical models. Artificial Intelligence, 171(2-3), 73-106. (Pubitemid 46328845)
24. Dechter, R., & Pearl, J. (1987). Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34, 1-38.
25. Dechter, R., & Pearl, J. (1989). Tree clustering for constraint networks. Artificial Intelligence, 38, 353-366.
26. Dechter, R., & Rish, I. (1997). A scheme for approximating probabilistic inference. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI'97), pp. 132-141.
27. Dechter, R., & Rish, I. (2003). Mini-buckets: A general scheme for approximating inference. Journal of ACM, 50(2), 107-153.
28. Fishelson,M., & Geiger, D. (2003). Optimizing exact genetic linkage computations. In Proceedings of the Seventh Annual International Conference on Computational Biology (RECOMB'03), pp. 114-121.
29. Gallager, R. G. (1963). Low-Density Parity-Check Codes. MIT Press, Cambridge, MA.
30. Gogate, V., & Dechter, R. (2007). SampleSearch: A scheme that searches for consistent samples. In Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics (AISTATS'07), pp. 147-154.
31. Gogate, V. (2009). Sampling Algorithms for Probabilistic Graphical models with Determinism. Ph.D. thesis, School of Information and Computer Sciences, University of California, Irvine.
32. Gomez, V., Mooji, J. M., & Kappen, H. J. (2007). Truncating the loop series expansion for belief propagation. Journal of Machine Learning, 8, 1987-2016.
33. Gottlob, G., Leone, N., & Scarcello, F. (2000). A comparison of structural CSP decomposition methods. Artificial Intelligence, 243-282.
34. Jensen, F. V., Lauritzen, S. L., & Olesen, K. G. (1990). Bayesian updating in causal probabilistic networks by local computation. Computational Statistics Quarterly, 4, 269-282.
35. Kask, K. (2001). Approximation algorithms for graphical models. Ph.D. thesis, Information and Computer Science, University of California, Irvine.
36. Kask, K., & Dechter, R. (2001). A general scheme for automatic search heuristics from specification dependencies. Artificial Intelligence, 129(1-2), 91-131.
37. Kask, K., Dechter, R., Larrosa, J., & Dechter, A. (2005). Unifying cluster-tree decompositions for reasoning in graphical models. Artificial Intelligence, 166 (1-2), 165-193.
38. Kikuchi, R. (1951). A theory of cooperative phenomena. Phys. Rev., 81(6), 988-1003.
39. Koller, D. (2010). Belief propagation in loopy graphs. In Dechter, R., Geffner, H., & Halpern, J. (Eds.), Heuristics, Probabilities and Causality: A Tribute to Judea Pearl.
40. Larrosa, J., Kask, K., & Dechter, R. (2001). Up and down mini-bucket: a scheme for approximating combinatorial optimization tasks. Tech. rep., University of California Irvine.
41. Lauritzen, S. L., & Spiegelhalter, D. J. (1988). Local computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50(2), 157-224.
42. Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99-118.
43. Mézard, M., & Montanari, A. (2009). Information, Physics and Computation. Oxford University Press.
44. Mézard, M., Parisi, G., & Zecchina, R. (2002). Analytic and algorithmic solution of random satisfiability problems. Science, 297, 812-815.
45. Maier, D. (1983). The Theory of Relational Databases. Computer Science Press, Rockville, MD.
46. Mateescu, R., Dechter, R., & Kask, K. (2002). Tree approximation for belief updating. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI'02), pp. 553-559.
47. McEliece, R. J., MacKay, D. J. C., & Cheng, J. F. (1998). Turbo decoding as an instance of Pearl's belief propagation algorithm. IEEE J. Selected Areas in Communication, 16(2), 140-152.
48. McEliece, R. J., & Yildirim, M. (2002). Belief propagation on partially ordered sets. In Mathematical Systems Theory in Biology, Communications, Computation, and Finance, pp. 275-300.
49. Minka, T. (2001). Expectation propagation for approximate bayesian inference. In Proceedings of the Seventeenth Annual Conference on Uncertainty in Artificial Intelligence (UAI'01), pp. 362-369.
50. Minka, T., & Qi, Y. (2004). Tree-structured approximations by expectation propagation. In Advances in Neural Information Processing Systems 16 (NIPS'03).
51. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann.
52. Pelizzola, A. (2005). Cluster variation method in statistical physics and probabilistic graphical models. Journal of Physics A: Mathematical and General, 38(33), R309-R339.
53. Rollon, E., & Dechter, R. (2010). Evaluating partition strategies for mini-bucket elimination. In The Eleventh International Symposium on Artificial Intelligence and Mathematics (ISAIM'10).
54. Roth, D. (1996). On the hardness of approximate reasoning. Artificial Intelligence, 82(1-2), 273-302.
55. Shafer, G. R., & Shenoy, P. P. (1990). Probability propagation. Annals of Mathematics and Artificial Intelligence, 2, 327-352.
56. Shenoy, P. P. (1992). Valuation-based systems for bayesian decision analysis. Operations Research, 40, 463-484.
57. Welling, M., Minka, T. P., & Teh, Y.W. (2005). Structured region graphs: Morphing ep into gbp. In Proceedings of the Twenty First Conference on Uncertainty in Artificial Intelligence (UAI'05), pp. 609-614.
58. Wexler, Y., & Meek, C. (2008). MAS: A multiplicative approximation scheme for probabilistic inference. In Proceedings of Advances in Neural Information Processing Systems 21 (NIPS'08), pp. 1761-1768.
59. Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000). Generalized belief propagation. Tech. rep. TR2000-26, Mitsubishi Electric Research Laboratories.
60. Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2001). Generalized belief propagation. In Advances in Neural Information Processing Systems 13 (NIPS'00), pp. 689-695.
61. Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005). Constructing free energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51, 2282-2312.
62. Yuan, C., & Druzdzel, M. J. (2003). An importance sampling algorithm based on evidence prepropagation. In Proceedings of the Nineteenth Conference in Uncertainty in Artificial Intelligence (UAI'03), pp. 624-631.
63. Zhang, N. L., Qi, R., & Poole, D. (1994). A computational theory of decision networks. International Journal of Approximate Reasoning, 11, 83-158.