Abstract
The PC algorithm is one of the most prominent constraint-based methods for learning causal structures from observational data. The algorithm relies on conditional independence (CI) tests to infer the structure and its time consumption heavily depends on the number of performed CI tests. We present a modification, called ED-PC, such that – in the oracle model – both ED-PC and the original PC algorithm infer the same structure. However, by using a new idea allowing the detection of a v-structure without explicit knowledge of a separating set, our method reduces the number of needed CI tests significantly. This is made possible by detecting nonadjacencies considerably earlier.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For exact definitions of the notions used in the algorithm, see Sect. 2.
- 2.
We use iff as shorthand for “if and only if”.
References
Andersson, S.A., Madigan, D., Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Ann. Stat. 25(2), 505–541 (1997)
Baba, K., Shibata, R., Sibuya, M.: Partial correlation and conditional correlation as measures of conditional independence. Aust. N. Z. J. Stat. 46(4), 657–664 (2004)
Bergsma, W.P.: Testing conditional independence for continuous random variables. Eurandom (2004)
Colombo, D., Maathuis, M.H., Kalisch, M., Richardson, T.S.: Learning high-dimensional directed acyclic graphs with latent and selection variables. Ann. Stat. 40, 294–321 (2012)
Doran, G., Muandet, K., Zhang, K., Schölkopf, B.: A permutation-based kernel conditional independence test. In: UAI, pp. 132–141 (2014)
Harris, N., Drton, M.: PC algorithm for nonparanormal graphical models. J. Mach. Learn. Res. 14(1), 3365–3383 (2013)
Kalisch, M., Bühlmann, P.: Estimating high-dimensional directed acyclic graphs with the PC-Algorithm. J. Mach. Learn. Res. 8, 613–636 (2007)
Meek, C.: Causal inference and causal explanation with background knowledge. In: Proceedings of UAI 1995, pp. 403–410. MK Publishers Inc. (1995)
Pearl, J.: Causality: Models, Reasoning and Inference, 2nd edn. Cambridge University Press, Cambridge (2009)
Scutari, M.: Learning Bayesian networks with the bnlearn R package. J. Stat. Softw. 35(3), 1–22 (2010)
Sondhi, A., Shojaie, A.: The reduced PC-algorithm: improved causal structure learning in large random networks. J. Mach. Learn. Res. 20(164), 1–31 (2019)
Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search, 2nd edn. MIT Press, Cambridge (2000)
Talvitie, T., Parviainen, P.: Learning Bayesian networks with cops and robbers. In: The 10th International Conference on Probabilistic Graphical Models (2020)
Verma, T., Pearl, J.: Equivalence and synthesis of causal models. In: Proceedings of UAI 1990, pp. 255–270. Elsevier (1990)
Wienöbst, M., Liśkiewicz, M.: Recovering causal structures from low-order conditional independencies. In: 34th AAAI Conference on Artificial Intelligence (AAAI), pp. 10302–10309 (2020)
Zhang, H., Zhou, S., Zhang, K., Guan, J.: Causal discovery using regression-based conditional independence tests. In: Thirty-First AAAI Conference on Artificial Intelligence (2017)
Zhang, K., Peters, J., Janzing, D., Schölkopf, B.: Kernel-based conditional independence test and application in causal discovery. In: 27th Conference on Uncertainty in Artificial Intelligence (UAI 2011), pp. 804–813. AUAI Press (2011)
Acknowledgements
This work was supported by the Deutsche Forschungsgemeinschaft (DFG) grant LI634/4-2.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Wienöbst, M., Liśkiewicz, M. (2021). An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm. In: Edelkamp, S., Möller, R., Rueckert, E. (eds) KI 2021: Advances in Artificial Intelligence. KI 2021. Lecture Notes in Computer Science(), vol 12873. Springer, Cham. https://doi.org/10.1007/978-3-030-87626-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-87626-5_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-87625-8
Online ISBN: 978-3-030-87626-5
eBook Packages: Computer ScienceComputer Science (R0)