Abstract
Counting and sampling directed acyclic graphs (DAGs) from a Markov equivalence class are fundamental tasks in graphical causal analysis. In this paper, we discuss recently proposed polynomial-time algorithms for these tasks. The presented result solves a long-standing open problem in graphical modelling. Experiments show that the proposed algorithms are implementable and effective in practice. Our paper is an extended abstract of the work [24], honored as an AAAI-21 Distinguished Paper at the 35th AAAI Conference on Artificial Intelligence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
AhmadiTeshnizi, A., Salehkaleybar, S., Kiyavash, N.: Lazyiter: a fast algorithm for counting Markov equivalent DAGs and designing experiments. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020 (2020)
Andersson, S.A., Madigan, D., Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Ann. Stat. 25(2), 505–541 (1997)
Chickering, D.M.: Learning equivalence classes of Bayesian-network structures. J. Mach. Learn. Res. 2, 445–498 (2002)
Chickering, D.M.: Optimal structure identification with greedy search. J. Mach. Learn. Res. 3, 507–554 (2002)
Ganian, R., Hamm, T., Talvitie, T.: An efficient algorithm for counting Markov equivalent dags. In: Proccedings of the 34th Conference on Artificial Intelligence, AAAI 2020, pp. 10136–10143 (2020)
Ghassami, A., Salehkaleybar, S., Kiyavash, N., Bareinboim, E.: Budgeted experiment design for causal structure learning. In: Proceedings of the 35th International Conference on Machine Learning, ICML 2018, pp. 1719–1728 (2018)
Ghassami, A., Salehkaleybar, S., Kiyavash, N., Zhang, K.: Counting and sampling from Markovv equivalent dags using clique trees. In: Proceedings of the 33th Conference on Artificial Intelligence, AAAI 2019, pp. 3664–3671 (2019)
Hauser, A., Bühlmann, P.: Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs. J. Mach. Learn. Res. 13, 2409–2464 (2012)
He, Y.B., Geng, Z.: Active learning of causal networks with intervention experiments and optimal designs. J. Mach. Learn. Res. 9(Nov), 2523–2547 (2008)
He, Y., Jia, J., Yu, B.: Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs. J. Mach. Learn. Res. 16(79), 2589–2609 (2015)
Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Mach. Learn. 20(3), 197–243 (1995)
Koller, D., Friedman, N.: Probabilistic Graphical Models - Principles and Techniques. MIT Press, Cambridge (2009)
Maathuis, M.H., Kalisch, M., Bühlmann, P.: Estimating high-dimensional intervention effects from observational data. Ann. Stat. 37(6A), 3133–3164 (2009)
Madigan, D., Andersson, S.A., Perlman, M.D., Volinsky, C.T.: Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Commun. Stat. Theory Methods 25(11), 2493–2519 (1996)
Meek, C.: Causal inference and causal explanation with background knowledge. In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, UAI 1995, pp. 403–410 (1995)
Meek, C.: Graphical Models: Selecting Causal and Statistical Models. Ph.D. thesis, Carnegie Mellon University (1997)
Pearl, J.: Causality. Cambridge University Press, Cambridge (2009)
Perković, E., Textor, J., Kalisch, M., Maathuis, M.H.: Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs. J. Mach. Learn. Res. 18, 220:1–220:62 (2017)
Shanmugam, K., Kocaoglu, M., Dimakis, A.G., Vishwanath, S.: Learning causal graphs with small interventions. In: Processing of the 28th Annual Conference on Neural Information Processing Systems, NIPS 2015, pp. 3195–3203 (2015)
Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search, Second Edition. MIT Press, Cambridge (2000)
Talvitie, T., Koivisto, M.: Counting and sampling Markov equivalent directed acyclic graphs. In: Proceedings of the 33th Conference on Artificial Intelligence, AAAI 2019, pp. 7984–7991 (2019)
Verma, T., Pearl, J.: Equivalence and synthesis of causal models. In: Proceedings of the 6th Annual Conference on Uncertainty in Artificial Intelligence, UAI 1990, pp. 255–270 (1990)
Verma, T., Pearl, J.: An algorithm for deciding if a set of observed independencies has a causal explanation. In: Proceedings of the 8th Annual Conference on Uncertainty in Artificial Intelligence, UAI 1992, pp. 323–330 (1992)
Wienöbst, M., Bannach, M., Liśkiewicz, M.: Polynomial-time algorithms for counting and sampling Markov equivalent dags. In: Proccedings of the 35th Conference on Artificial Intelligence, AAAI 2021 (2021, in press)
van der Zander, B., Liśkiewicz, M.: Separators and adjustment sets in Markov equivalent dags. In: Proceedings of the 30th Conference on Artificial Intelligence, AAAI 2016, pp. 3315–3321 (2016)
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., Bannach, M., Liśkiewicz, M. (2021). Recent Advances in Counting and Sampling Markov Equivalent DAGs. 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_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-87626-5_20
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)