Complexity results and approximation strategies for MAP explanations

Journal of Artificial Intelligence Research

Volumn 21, Issue , 2004, Pages 101-133

  Park, James D ^a   Darwiche, Adnan ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INFERENCE ENGINES; PROBABILITY;

APPROXIMATION ALGORITHMS; EXACT INFERENCE; MAP APPROXIMATION; MOST PROBABLE EXPLANATION (MPE);

PROBLEM SOLVING;

EID: 26944434018     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1236     Document Type: Review

References (25)

1. Dagum, P., & Luby, M. (1997). An optimal approximation algorithm for Bayesian inference. Artificial Intelligence, 93, 1-27.
2. Darwiche, A. (2001). Recursive conditioning. Artificial Intelligence, 126(1-2), 5-41.
3. Darwiche, A. (2003). A differential approach to inference in Bayesian networks. Journal of the ACM, 50(3), 280-305.
4. de Campos, L., Gamez, J., & Moral, S. (1999). Partial abductive inference in Bayesian belief networks using a genetic algorithm. Pattern Recognition Letters, 20(11-13), 1211-1217.
5. Dechter, R., & Rish, I. (1998). Mini-buckets: A general scheme for approximate inference. Tech. rep. R62a, Information and Computer Science Department, UC Irvine.
6. Dechter, R. (1996). Bucket elimination: A unifying framework for probabilistic inference. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 211-219.
7. Huang, C., & Darwiche, A. (1996). Inference in belief networks: A procedural guide. International Journal of Approximate Reasoning, 15(3), 225-263.
8. Jensen, F. V., Lauritzen, S., & Olesen, K. (1990). Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly, 4, 269-282.
9. Kask, K., & Dechter, R. (1999). Stochastic local search for Bayesian networks. In Seventh International Workshop on Artificial Intelligence, Fort Lauderdale, FL. Morgan Kaufmaann.
10. Kjaerulff, U. (1990). Triangulation of graphs - algorithms giving small total state space. Tech. rep. R-90-09, Department of Mathematics and Computer Science, University of Aalborg, Denmark.
11. Lauritzen, S. L., & 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. Litmman, M., Majercik, S. M., & Pitassi, T. (2001). Stochastic boolean satisfiability. Journal of Automated Reasoning, 27(3), 251-296.
13. Littman, M. (1999). Initial experiments in stochastic satisfiability. In Sixteenth National Conference on Artificial Intelligence, pp. 667-672.
14. Littman, M., Goldsmith, J., & Mundhenk, M. (1998). The computational complexity of probabilistic planning.. Journal of Artificial Intelligence Research, 9, 1-36.
15. McEliece, R. J., Rodemich, E., & Cheng, J. F. (1995). The turbo decision algorithm. In 33rd Allerton Conference on Communications, Control and Computing, pp. 366-379.
16. Mengshoel, O. J., Roth, D., & Wilkins, D. C. (2000). Stochastic greedy search: Efficiently computing a most probable explanation in Bayesian networks. Tech. rep. UIUCDS-R-2000-2150, U of Illinois Urbana-Champaign.
17. Murphy, K. P., Weiss, Y., & Jordan, M. I. (1999). Loopy belief propagation for approximate inference: an emperical study. In Proceedings of Uncertainty in AI.
18. Papadimitriou, C., & Tsitsiklis, J. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12(3), 441-450.
19. Park, J., & Darwiche, A. (2003). A differential semantics for jointree algorithms. In Neural Information Processing Systems (NIPS) 15.
20. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo, California.
21. Roth, D. (1996). On the hardness of approximate reasoning. Artificial Intelligence, 82(1-2), 273-302.
22. Shenoy, P. P., & Shafer, G. (1986). Propagating belief functions with local computations. IEEE Expert, 1(3), 43-52.
23. Shimony, S. E. (1994). Finding MAPs for belief networks is NP-hard. Artificial Intelligence, 68(2), 399-410.
24. Toda, S. (1991). PP is as hard as the polynomial-time hierarchy. SIAM Journal of Computing, 20, 865-877.
25. Yedidia, J., Freeman, W., & Weiss, Y. (2000). Generalized belief propagation. In NIPS, Vol. 13.