Abstract
Importance sampling is a powerful approximate inference technique for Bayesian networks. However, the performance tends to be poor when the network exhibits deterministic causalities. Deterministic causalities yield predictable influences between statistical variables. In other words, only a strict subset of the set of all variable states is permissible to sample. Samples inconsistent with the permissible state space do not contribute to the sum estimate and are effectively rejected during importance sampling. Detecting inconsistent samples is NP-hard, since it amounts to calculating the posterior probability of a sample given some evidence. Several methods have been proposed to cache inconsistent samples to improve sampling efficiency. However, cache-based methods do not effectively exploit overlap in the state patterns generated by determinism in a local network structure to compress state information. In this paper, we propose a new algorithm to reduce the overhead of caching by using an adaptive decision tree to efficiently store and detect inconsistent samples. Experimental results show that the proposed approach outperforms existing methods to sample Bayesian networks with deterministic causalities.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bilmes, J., Dechter, R.: Evaluation of Probabilistic Inference System (2006), http://ssli.ee.washington.edu/~bilmes/uai06InferenceEvaluation/
Boutilier, C., Friedman, N., Goldszmidt, M., Koller, D.: Context-specific independence in Bayesian networks. In: Proc. Twelfth Conf. on Uncertainty in Artificial Intelligence (UAI 1996), pp. 115–123 (1996)
Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)
Cheng, J., Druzdzel, M.J.: AIS-BN: An adaptive importance sampling algorithm for evidential reasoning in large Bayesian networks. Journal of Artificial Intelligence Research 13, 155–188 (2000)
Conati, C., Gertner, A.S., VanLehn, K., Druzdzel, M.J.: On-line student modeling for coached problem solving using Bayesian networks. In: Proceedings of the Sixth International Conference on User Modeling (UM 1996), pp. 231–242. Springer, Vienna (1997)
Cooper, G.F.: The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence 42(2-3), 393–405 (1990)
Dechter, R., Mateescu, R.: Mixtures of deterministic-probabilistic networks and their and/or search space. In: UAI 2004: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, pp. 120–129. UAI Press, Arlington (2004)
Gogate, V., Dechter, R.: Approximate inference algorithms for hybrid Bayesian networks with discrete constraints. In: Proceedings of Uncertainty in Artificial Intelligence, pp. 209–216 (2005)
Gogate, V., Dechter, R.: A new algorithm for sampling CSP solutions uniformly at random. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 711–715. Springer, Heidelberg (2006)
Gogate, V., Dechter, R.: Approximate counting by sampling the backtrack-free search space. In: Conference on Artificial Intelligence (AAAI), pp. 198–203 (2007)
Gogate, V., Dechter, R.: SampleSearch: Importance sampling in presence of determinism. Artificial Intelligence 175(2), 694–729 (2011)
Guo, H., Hsu, W.: A survey on algorithms for real-time Bayesian network inference. In: The Joint AAAI 2002/KDD 2002/UAI 2002 Workshop on Real-Time Decision Support and Diagnosis Systems. Edmonton, Alberta (2002)
Heckerman, D.E., Horvitz, E.J., Nathwani, B.N.: Toward normative expert systems: Part I the Pathfinder project. Methods of Information in Medicine 31, 90–105 (1992)
Mateescu, R., Dechter, R.: Mixed deterministic and probabilistic networks. Annals of Mathematics and Artificial Intelligence 54(1-3), 3–51 (2008)
Moral, S., Salmerón, A.: Dynamic importance sampling in Bayesian networks based on probability trees. International Journal of Approximate Reasoning 38, 245–261 (2005)
Neapolitan, R.E.: Probabilistic Reasoning in Expert Systems. John Wiley and Sons, NY (1990)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo (1988)
Poole, D.: Exploiting contextual independence and approximation in belief network inference. Tech. rep., University of British Columbia (1997)
Poole, D.: Probabilistic partial evaluation: Exploiting rule structure in probabilistic inference. In: Proc. 15th International Joint Conference on AI (IJCAI 1997), pp. 1284–1291 (1997)
Rubinstein, R.Y.: Simulation and Monte Carlo Method. John Wiley and Sons, Hoboken (1981)
Russell, S., Norvig, P.: Artificial intelligence: A modern approach. Prentice Hall Series in Artificial Intelligence. Prentice Hall, Englewood Cliffs (1995)
Salmerón, A., Cano, A., Moral, S.: Importance sampling in Bayesian networks using probability trees. Comput. Stat. Data Anal. 34(4), 387–413 (2000)
Shachter, R.D., Peot, M.A.: Simulation approaches to general probabilistic inference on belief networks. In: Proceedings of the 5th Conference on Uncertainty in Artificial Intelligence, vol. 5 (1990)
Yu, H., van Engelen, R.: Refractor importance sampling. In: Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, pp. 603–611 (July 2008)
Yuan, C., Druzdzel, M.J.: Importance sampling algorithms for Bayesian networks: Principles and performance. Mathematical and Computer Modelling 43, 1189–1207 (2006)
Yuan, C., Druzdzel, M.J.: An importance sampling algorithm based on evidence pre-propagation. In: Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence, pp. 624–631 (July 2003)
Yuan, C., Druzdzel, M.J.: Importance sampling in Bayesian networks an influence-based approximation strategy for importance functions. In: Proceedings of the 21th Conference on Uncertainty in Artificial Intelligence, pp. 650–657 (July 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, H., van Engelen, R. (2011). Importance Sampling on Bayesian Networks with Deterministic Causalities. In: Liu, W. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2011. Lecture Notes in Computer Science(), vol 6717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22152-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-22152-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22151-4
Online ISBN: 978-3-642-22152-1
eBook Packages: Computer ScienceComputer Science (R0)