Polynomial constraints in causal Bayesian networks
Authors: 
Changsung Kang, Jin TianAuthors Info & Claims
Pages 200 - 208
Abstract
We use the implicitization procedure to generate polynomial equality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network with hidden variables. We show how we may reduce the complexity of the implicitization problem and make the problem tractable in certain causal Bayesian networks. We also show some preliminary results on the algebraic structure of polynomial constraints. The results have applications in distinguishing between causal models and in testing causal models with combined observational and experimental data.
References
[1]
[Desjardins, 1999] B. Desjardins. On the theoretical limits to reliable causal inference. PhD thesis, University of Pittsburgh, 1999.
[2]
[Garcia et al., 2005] L.D. Garcia, M. Stillman, and B. Sturmfels. Algebraic geometry of bayesian networks. Journal of Symbolic Computation, 39(3-4):331-355, 2005.
[3]
[Garcia, 2004] Luis David Garcia. Algebraic statistics in model selection. In Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI-04), pages 177-18, Arlington, Virginia, 2004. AUAI Press.
[4]
[Geiger and Meek, 1998] Dan Geiger and Christopher Meek. Graphical models and exponential families. In Proceedings of the Fourteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 156-165, San Francisco, CA, 1998. Morgan Kaufmann Publishers.
[5]
[Geiger and Meek, 1999] Dan Geiger and Christopher Meek. Quantifier elimination for statistical problems. In Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), pages 226-235, San Francisco, CA, 1999. Morgan Kaufmann Publishers.
[6]
[Greuel et al., 2005] G.-M. Greuel, G. Pfister, and H. Schönemann. SINGULAR 3.0. A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern, 2005. http://www.singular.uni-kl.de.
[7]
[Heckerman and Shachter, 1995] D. Heckerman and R. Shachter. Decision-theoretic foundations for causal reasoning. Journal of Artificial Intelligence Research, 3:405-430, 1995.
[8]
[Kang and Tian, 2006] C. Kang and J. Tian. Inequality constraints in causal models with hidden variables. In Proceedings of the Seventeenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-06), pages 233-240, Arlington, Virginia, 2006. AUAI Press.
[9]
[Lauritzen, 2000] S. Lauritzen. Graphical models for causal inference. In O.E. Barndorff-Nielsen, D. Cox, and C. Kluppelberg, editors, Complex Stochastic Systems, chapter 2, pages 67-112. Chapman and Hall/CRC Press, London/Boca Raton, 2000.
[10]
[Pearl, 1995] J. Pearl. Causal diagrams for empirical research. Biometrika, 82:669-710, December 1995.
[11]
[Pearl, 2000] J. Pearl. Causality: Models, Reasoning, and Inference. Cambridge University Press, NY, 2000.
[12]
[Riccomagno and Smith, 2003] E. Riccomagno and J.Q. Smith. Non-graphical causality: a generalization of the concept of a total cause. Technical Report No. 394, Department of Statistics, University of Warwick, 2003.
[13]
[Riccomagno and Smith, 2004] E. Riccomagno and J.Q. Smith. Identifying a cause in models which are not simple bayesian networks. In Proceedings of IPMU, pages 1315-1322, Perugia, 2004.
[14]
[Robins and Wasserman, 1997] James M. Robins and Larry A. Wasserman. Estimation of effects of sequential treatments by reparameterizing directed acyclic graphs. In Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-97), pages 409-420, San Francisco, CA, 1997. Morgan Kaufmann Publishers.
[15]
[Spirtes et al., 2001] P. Spirtes, C. Glymour, and R. Schemes. Causation, Prediction, and Search. MIT Press, Cambridge, MA, 2001.
[16]
[Tian and Pearl, 2002] J. Tian and J. Pearl. On the testable implications of causal models with hidden variables. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI), 2002.
[17]
[Verma and Pearl, 1990] T. Verma and J. Pearl. Equivalence and synthesis of causal models. In P. Bonissone et al., editor, Uncertainty in Artificial Intelligence 6, pages 220-227. Elsevier Science, Cambridge, MA, 1990.
- Polynomial constraints in causal Bayesian networks
Recommendations
IDENTIFIABILITY IN CAUSAL BAYESIAN NETWORKS: A GENTLE INTRODUCTION
In this article we describe an important structure used to model causal theories and a related problem of great interest to semi-empirical scientists. A causal Bayesian network is a pair consisting of a directed acyclic graph (called a causal graph) ...
Explanation trees for causal Bayesian networks
UAI'08: Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial IntelligenceBayesian networks can be used to extract explanations about the observed state of a subset of variables. In this paper, we explicate the desiderata of an explanation and confront them with the concept of explanation proposed by existing methods. The ...
Identifiability in causal Bayesian networks: a sound and complete algorithm
AAAI'06: proceedings of the 21st national conference on Artificial intelligence - Volume 2This paper addresses the problem of identifying causal effects from nonexperimental data in a causal Bayesian network, i.e., a directed acyclic graph that represents causal relationships. The identifiability question asks whether it is possible to ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
AUAI Press
Arlington, Virginia, United States
Publication History
Published: 19 July 2007
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Dec 2024