The DOI matches its Crossref record; 93 of the 94 references it cites were found in a registry or an index, and 1 are not checked yet.
Causal Structure Learning: A Combinatorial Perspective
Open accessAbstract
In this review, we discuss approaches for learning causal structure from data, also called causal discovery. In particular, we focus on approaches for learning directed acyclic graphs and various generalizations which allow for some variables to be unobserved in the available data. We devote special attention to two fundamental combinatorial aspects of causal structure learning. First, we discuss the structure of the search space over causal graphs. Second, we discuss the structure of equivalence classes over causal graphs, i.e., sets of graphs which represent what can be learned from observational data alone, and how these equivalence classes can be refined by adding interventional data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures






![Fig. 7 A greedy step over minimal I-MAPs performed by GSP. a True graph G^(∗), to which the distribution P(X) is faithful. b Minimal I-MAP associated with the permutation π⁽⁰⁾=[2,4,1,3], with covered edges shown in red. c Minimal I-MAP associated with the permutation π⁽¹⁾=[2,4,3,1], obtained after flipping the covered edge 1→3 (Color figure online)](https://figures.cochat.ai/paper-figures/73fab959ba6048f7b555a1845c24c333/causal-structure-learning-a-combinatorial-perspective-figure-7.jpg)
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“A key difficulty for applying the potential outcome framework for our task is ‘the mixing of confounders with outcomes’.”
From Causal identification of single-cell experimental perturbation effects with CINEMA-OT (2023) · cites this paper as [19]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Causality: Models, Reasoning, and Inference
Pearl, J. (2009) · doi:10.1017/cbo9780511803161 · Cited by 11,653
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
The max-min hill-climbing Bayesian network structure learning algorithm
Tsamardinos, I., Brown, L. E., & Aliferis, C. F. (2006) · Machine Learning · doi:10.1007/s10994-006-6889-7 · Cited by 1,822 · cited 1×
“Beyond the constraint-based and score-based paradigms for causal structure learning already discussed, there are a variety of hybrid methods [170, 142, 144, 7, 120], which generally use constraints to reduce the search space, and scores to optimize over this reduced search space.”
MethodBayesian Graphical Models for Discrete Data
Madigan, D., York, J., & Allard, D. (1995) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403615 · Cited by 1,090 · cited 1×
“Markov chain Monte Carlo (MCMC) methods have been especially popular, beginning with the structure MCMC algorithm [110],”
MethodLearning Bayesian networks is NP-complete
Chickering, D. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2404-4_12 · Cited by 1,001
Review of Causal Discovery Methods Based on Graphical Models
Glymour, C., Zhang, K., & Spirtes, P. (2019) · Frontiers in Genetics · doi:10.3389/fgene.2019.00524 · Cited by 860
Friedman, N., & Koller, D. (2003) · Machine Learning · doi:10.1023/a:1020249912095 · Cited by 811 · cited 8×
“Markov chain Monte Carlo (MCMC) methods have been especially popular, beginning with the structure MCMC algorithm [110], which runs a Metropolis–Hastings algorithm over the space of DAG models, using edge additions and deletions to move in this space.”
MethodInfluential
Research works printed but not linked: 99
- Acharya, J., Bhattacharyya, A., Daskalakis, C., Kandasamy, S.: Learning and testing causal models with interventions. Advances in Neural Information Processing Systems 31 (2018)
- Addanki, R., Kasiviswanathan, S., McGregor, A., Musco, C.: Efficient intervention design for causal discovery with latents. In: International Conference on Machine Learning, pp. 63–73. PMLR (2020)
- Agrawal, R., Squires, C., Yang, K., Shanmugam, K., Uhler, C.: ABCD-strategy: Budgeted experimental design for targeted causal structure discovery. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 3400–3409. PMLR (2019)
- Agrawal, R., Uhler, C., Broderick, T.: Minimal I-MAP MCMC for scalable structure discovery in causal DAG models. In: International Conference on Machine Learning, pp. 89–98. PMLR (2018)
- AhmadiTeshnizi, A., Salehkaleybar, S., Kiyavash, N.: Lazyiter: a fast algorithm for counting Markov equivalent DAGs and designing experiments. In: International Conference on Machine Learning, pp. 125–133. PMLR (2020)
- Bareinboim, E., Pearl, J.: Transportability from multiple environments with limited experiments: Completeness results. Advances in neural information processing systems 27 (2014)
- Bernstein, D., Saeed, B., Squires, C., Uhler, C.: Ordering-based causal structure learning in the presence of latent variables. In: International Conference on Artificial Intelligence and Statistics, pp. 4098–4108. PMLR (2020)
- Bhattacharya, R., Nagarajan, T., Malinsky, D., Shpitser, I.: Differentiable causal discovery under unmeasured confounding. In: International Conference on Artificial Intelligence and Statistics, pp. 2314–2322. PMLR (2021)
- Brenner, E., Sontag, D.: SparsityBoost: a new scoring function for learning Bayesian network structure. In: Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, pp. 112–121 (2013)
- Brouillard, P., Lachapelle, S., Lacoste, A., Lacoste-Julien, S., Drouin, A.: Differentiable causal discovery from interventional data. Advances in Neural Information Processing Systems 33, 21865–21877 (2020)
- Cai, R., Xie, F., Glymour, C., Hao, Z., Zhang, K.: Triad constraints for learning causal structure of latent variables. Advances in neural information processing systems 32 (2019)
- Castelletti, F., Peluso, S.: Network structure learning under uncertain interventions. Journal of the American Statistical Association (just-accepted), 1–28 (2022)
- Chen, R., Dash, S., Gao, T.: Integer programming for causal structure learning in the presence of latent variables. In: International Conference on Machine Learning, pp. 1550–1560. PMLR (2021)
- Chickering, D.M.: A transformational characterization of equivalent Bayesian network structures. In: Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, pp. 87–98 (1995)
- Chickering, D.M.: Optimal structure identification with greedy search. Journal of machine learning research 3(Nov), 507–554 (2002)
- Chickering, M.: Statistically efficient greedy equivalence search. In: Conference on Uncertainty in Artificial Intelligence, pp. 241–249. PMLR (2020)
- Chobtham, K., Constantinou, A.C.: Bayesian network structure learning with causal effects in the presence of latent variables. In: International Conference on Probabilistic Graphical Models, pp. 101–112. PMLR (2020)
- Claassen, T., Mooij, J.M., Heskes, T.: Learning sparse causal models is not NP-hard. In: Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, pp. 172–181 (2013)
- Cooper, G.F., Yoo, C.: Causal discovery from a mixture of experimental and observational data. In: Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence, pp. 116–125 (1999)
- Correa, J., Bareinboim, E.: General transportability of soft interventions: Completeness results. Advances in Neural Information Processing Systems 33, 10902–10912 (2020)
- Cussens, J.: Bayesian network learning with cutting planes. In: Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI 2011), pp. 153–160. AUAI Press (2011)
- Cussens, J.: GOBNILP: Learning Bayesian network structure with integer programming. In: M. Jaeger, T.D. Nielsen (eds.) Proceedings of the 10th International Conference on Probabilistic Graphical Models, Proceedings of Machine Learning Research, vol. 138, pp. 605–608. PMLR (2020). http://proceedings.mlr.press/v138/cussens20a.html
- Eaton, D., Murphy, K.: Exact Bayesian structure learning from uncertain interventions. In: Artificial intelligence and statistics, pp. 107–114. PMLR (2007)
- Eberhardt, F., Glymour, C., Scheines, R.: On the number of experiments sufficient and in the worst case necessary to identify all causal relations among n variables. In: Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, pp. 178–184 (2005)
- Friedman, N., Nachman, I.: Gaussian process networks. In: Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence, pp. 211–219 (2000)
- Frot, B., Nandy, P., Maathuis, M.H.: Robust causal structure learning with some hidden variables. arXiv preprint arXiv:1708.01151 (2017) · arXiv
- Gao, M., Aragam, B.: Efficient Bayesian network structure learning via local Markov boundary search. Advances in Neural Information Processing Systems 34 (2021)
- Ghassami, A., Salehkaleybar, S., Kiyavash, N., Bareinboim, E.: Budgeted experiment design for causal structure learning. In: International Conference on Machine Learning, pp. 1724–1733. PMLR (2018)
- Ghassami, A., Yang, A., Kiyavash, N., Zhang, K.: Characterizing distribution equivalence and structure learning for cyclic and acyclic directed graphs. In: International Conference on Machine Learning, pp. 3494–3504. PMLR (2020)
- Ghoshal, A., Honorio, J.: Information-theoretic limits of Bayesian network structure learning. In: Artificial Intelligence and Statistics, pp. 767–775. PMLR (2017)
- Ghoshal, A., Honorio, J.: Learning identifiable Gaussian Bayesian networks in polynomial time and sample complexity. Advances in Neural Information Processing Systems 30 (2017)
- Gillispie, S.B., Lemieux, C.: Enumerating Markov Equivalence Classes of Acyclic Digraph Models. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pp. 171–177 (2001)
- Greenewald, K., Katz, D., Shanmugam, K., Magliacane, S., Kocaoglu, M., Boix Adsera, E., Bresler, G.: Sample efficient active learning of causal trees. Advances in Neural Information Processing Systems 32 (2019)
- Harris, N., Drton, M.: PC algorithm for nonparanormal graphical models. Journal of Machine Learning Research 14(11) (2013)
- Hauser, A., Bühlmann, P.: Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs. The Journal of Machine Learning Research 13(1), 2409–2464 (2012)
- He, Y., Jia, J., Yu, B.: Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs. The Journal of Machine Learning Research 16(1), 2589–2609 (2015)
- He, Y.B., Geng, Z.: Active learning of causal networks with intervention experiments and optimal designs. Journal of Machine Learning Research 9(Nov), 2523–2547 (2008)
- Hu, Z., Evans, R.: Faster algorithms for Markov equivalence. In: Conference on Uncertainty in Artificial Intelligence, pp. 739–748. PMLR (2020)
- Hyttinen, A., Eberhardt, F., Hoyer, P.O.: Learning linear cyclic causal models with latent variables. The Journal of Machine Learning Research 13(1), 3387–3439 (2012)
- Hyttinen, A., Eberhardt, F., Hoyer, P.O.: Experiment selection for causal discovery. Journal of Machine Learning Research 14, 3041–3071 (2013)
- Hyttinen, A., Eberhardt, F., Järvisalo, M.: Constraint-based causal discovery: Conflict resolution with answer set programming. In: UAI, pp. 340–349 (2014)
- Jaakkola, T., Sontag, D., Globerson, A., Meila, M.: Learning Bayesian network structure using LP relaxations. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 358–365. JMLR Workshop and Conference Proceedings (2010)
- Jaber, A., Kocaoglu, M., Shanmugam, K., Bareinboim, E.: Causal discovery from soft interventions with unknown targets: Characterization and learning. Advances in neural information processing systems 33, 9551–9561 (2020)
- Kalisch, M., Bühlman, P.: Estimating high-dimensional directed acyclic graphs with the PC-algorithm. Journal of Machine Learning Research 8(3) (2007)
- Kano, Y., Shimizu, S., et al.: Causal inference using nonnormality. In: Proceedings of the international symposium on science of modeling, the 30th anniversary of the information criterion, pp. 261–270 (2003)
- Katz, D., Shanmugam, K., Squires, C., Uhler, C.: Size of interventional Markov equivalence classes in random DAG models. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 3234–3243. PMLR (2019)
- Kivva, B., Rajendran, G., Ravikumar, P., Aragam, B.: Learning latent causal graphs via mixture oracles. Advances in Neural Information Processing Systems 34 (2021)
- Kocaoglu, M., Dimakis, A., Vishwanath, S.: Cost-optimal learning of causal graphs. In: International Conference on Machine Learning, pp. 1875–1884. PMLR (2017)
- Kocaoglu, M., Shanmugam, K., Bareinboim, E.: Experimental design for learning causal graphs with latent variables. Advances in Neural Information Processing Systems 30 (2017)
- Koivisto, M., Sood, K.: Exact Bayesian structure discovery in Bayesian networks. The Journal of Machine Learning Research 5, 549–573 (2004)
- Koster, J.T.: Marginalizing and conditioning in graphical models. Bernoulli pp. 817–840 (2002)
- Lachapelle, S., Brouillard, P., Deleu, T., Lacoste-Julien, S.: Gradient-Based Neural DAG Learning. In: International Conference on Learning Representations (2019)
- Lattimore, F., Lattimore, T., Reid, M.D.: Causal bandits: Learning good interventions via causal inference. Advances in Neural Information Processing Systems 29 (2016)
- Lindgren, E., Kocaoglu, M., Dimakis, A.G., Vishwanath, S.: Experimental design for cost-aware learning of causal graphs. Advances in Neural Information Processing Systems 31 (2018) · DOI
- Lorch, L., Rothfuss, J., Schölkopf, B., Krause, A.: DiBS: Differentiable Bayesian Structure Learning. Advances in Neural Information Processing Systems 34 (2021)
- Lu, Y., Meisami, A., Tewari, A.: Causal bandits with unknown graph structure. Advances in Neural Information Processing Systems 34 (2021)
- Meek, C.: Causal inference and causal explanation with background knowledge. In: Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, pp. 403–410 (1995)
- Meek, C.: Graphical models: Selecting causal and statistical models. Ph.D. thesis, PhD thesis, Carnegie Mellon University (1997)
- Nair, V., Patil, V., Sinha, G.: Budgeted and non-budgeted causal bandits. In: International Conference on Artificial Intelligence and Statistics, pp. 2017–2025. PMLR (2021)
- Niinimäki, T., Parviainen, P., Koivisto, M.: Structure discovery in Bayesian networks by sampling partial orders. The Journal of Machine Learning Research 17(1), 2002–2048 (2016)
- Park, G., Park, H.: Identifiability of generalized hypergeometric distribution (ghd) directed acyclic graphical models. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 158–166. PMLR (2019)
- Parviainen, P., Koivisto, M.: Bayesian structure discovery in Bayesian networks with less space. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 589–596. JMLR Workshop and Conference Proceedings (2010)
- Peters, J., Janzing, D., Schölkopf, B.: Elements of causal inference: foundations and learning algorithms. The MIT Press (2017)
- Radhakrishnan, A., Solus, L., Uhler, C.: Counting Markov equivalence classes by number of immoralities. In: 33rd Conference on Uncertainty in Artificial Intelligence. AUAI Press Corvallis (2017)
- Rajendran, G., Kivva, B., Gao, M., Aragam, B.: Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families. Advances in Neural Information Processing Systems 34 (2021)
- Ramsey, J., Spirtes, P., Zhang, J.: Adjacency-faithfulness and conservative causal inference. In: Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence, pp. 401–408 (2006)
- Richardson, T.S., Evans, R.J., Robins, J.M., Shpitser, I.: Nested Markov properties for acyclic directed mixed graphs. arXiv preprint arXiv:1701.06686 (2017) · arXiv
- Rothenhäusler, D., Heinze, C., Peters, J., Meinshausen, N.: Backshift: Learning causal cyclic graphs from unknown shift interventions. Advances in Neural Information Processing Systems 28 (2015)
- Saeed, B., Belyaeva, A., Wang, Y., Uhler, C.: Anchored causal inference in the presence of measurement error. In: Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence (2020)
- Saeed, B., Panigrahi, S., Uhler, C.: Causal structure discovery from distributions arising from mixtures of DAGs. In: International Conference on Machine Learning, pp. 8336–8345. PMLR (2020)
- Shimizu, S., Hoyer, P.O., Hyvärinen, A., Kerminen, A., Jordan, M.: A linear non-Gaussian acyclic model for causal discovery. Journal of Machine Learning Research 7(10) (2006)
- Shimizu, S., Inazumi, T., Sogawa, Y., Hyvärinen, A., Kawahara, Y., Washio, T., Hoyer, P.O., Bollen, K.: DirectLiNGAM: A direct method for learning a linear non-Gaussian structural equation model. The Journal of Machine Learning Research 12, 1225–1248 (2011)
- Shpitser, I., Pearl, J.: Identification of joint interventional distributions in recursive semi-Markovian causal models. In: proceedings of the 21st national conference on Artificial intelligence-Volume 2, pp. 1219–1226 (2006)
- Spirtes, P., Meek, C., Richardson, T.: Causal inference in the presence of latent variables and selection bias. In: Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, pp. 499–506 (1995)
- Spirtes, P., Richardson, T.: A polynomial time algorithm for determining DAG equivalence in the presence of latent variables and selection bias. In: Proceedings of the 6th International Workshop on Artificial Intelligence and Statistics, pp. 489–500 (1996)
- Squires, C., Magliacane, S., Greenewald, K., Katz, D., Kocaoglu, M., Shanmugam, K.: Active structure learning of causal DAGs via directed clique trees. Advances in Neural Information Processing Systems 33, 21500–21511 (2020)
- Squires, C., Wang, Y., Uhler, C.: Permutation-based causal structure learning with unknown intervention targets. In: Conference on Uncertainty in Artificial Intelligence, pp. 1039–1048. PMLR (2020)
- Squires, C., Yun, A., Nichani, E., Agrawal, R., Uhler, C.: Causal structure discovery between clusters of nodes induced by latent factors. In: First Conference on Causal Learning and Reasoning (2022)
- Strobl, E.V.: Improved causal discovery from longitudinal data using a mixture of DAGs. In: The 2019 ACM SIGKDD Workshop on Causal Discovery, pp. 100–133. PMLR (2019)
- Studeny, M.: Probabilistic conditional independence structures. Springer Science & Business Media (2006)
- Studenỳ, M., Hemmecke, R., Lindner, S.: Characteristic imset: a simple algebraic representative of a Bayesian network structure. In: Proceedings of the 5th European workshop on probabilistic graphical models, pp. 257–264. HIIT Publications (2010)
- Sussex, S., Uhler, C., Krause, A.: Near-optimal multi-perturbation experimental design for causal structure learning. Advances in Neural Information Processing Systems 34 (2021)
- Tian, J., Pearl, J.: Causal discovery from changes. In: Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence, pp. 512–521 (2001)
- Triantafillou, S., Tsamardinos, I.: Constraint-based causal discovery from multiple interventions over overlapping variable sets. The Journal of Machine Learning Research 16(1), 2147–2205 (2015)
- Verma, T., Pearl, J.: Equivalence and synthesis of causal models. In: Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence, pp. 255–270 (1990)
- Wang, Y., Solus, L., Yang, K., Uhler, C.: Permutation-based causal inference algorithms with interventions. In: 31st Annual Conference on Neural Information Processing Systems, NIPS 2017, Long Beach, United States, 4 December 2017 through 9 December 2017, vol. 2017, pp. 5823–5832. Neural information processing systems foundation (2017)
- Wang, Y., Squires, C., Belyaeva, A., Uhler, C.: Direct estimation of differences in causal graphs. Advances in neural information processing systems 31 (2018)
- Wang, Y.S., Drton, M.: High-dimensional causal discovery under non-Gaussianity. Biometrika 107(1), 41–59 (2020)
- Xie, F., Cai, R., Huang, B., Glymour, C., Hao, Z., Zhang, K.: Generalized independent noise condition for estimating latent variable causal graphs. Advances in Neural Information Processing Systems 33, 14891–14902 (2020)
- Yang, K., Katcoff, A., Uhler, C.: Characterizing and learning equivalence classes of causal DAGs under interventions. In: International Conference on Machine Learning, pp. 5541–5550. PMLR (2018)
- Yu, Y., Chen, J., Gao, T., Yu, M.: DAG-GNN: DAG structure learning with graph neural networks. In: International Conference on Machine Learning, pp. 7154–7163. PMLR (2019)
- Zhalama, Zhang, J., Eberhardt, F., Mayer, W.: SAT-Based Causal Discovery under Weaker Assumptions. In: UAI (2017)
- Zhang, J., Spirtes, P.: Strong faithfulness and uniform consistency in causal inference. In: Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence, pp. 632–639 (2002)
- Zhang, J., Spirtes, P.: A transformational characterization of Markov equivalence for directed acyclic graphs with latent variables. In: Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, pp. 667–674 (2005)
- Zhang, K., Hyvärinen, A.: On the identifiability of the post-nonlinear causal model. In: 25th Conference on Uncertainty in Artificial Intelligence (UAI 2009), pp. 647–655. AUAI Press (2009)
- Zhang, K., Peters, J., Janzing, D., Schölkopf, B.: Kernel-based conditional independence test and application in causal discovery. In: Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, pp. 804–813 (2011)
- Zhang, V., Squires, C., Uhler, C.: Matching a desired causal state via shift interventions. Advances in Neural Information Processing Systems 34 (2021)
- Zhao, B., Wang, Y.S., Kolar, M.: Direct estimation of differential functional graphical models. Advances in Neural Information Processing Systems 32 (2019)
- Zheng, X., Aragam, B., Ravikumar, P.K., Xing, E.P.: DAGs with NO TEARS: Continuous Optimization for Structure Learning. Advances in Neural Information Processing Systems 31 (2018)
Cited by
Causal identification of single-cell experimental perturbation effects with CINEMA-OT
Dong, M., Wang, B., Wei, J., de O. Fonseca, A. H., Perry, C. J., Frey, A., Ouerghi, F., Foxman, E. F., Ishizuka, J. J., Dhodapkar, R. M., et al. (2023) · Nature Methods · doi:10.1038/s41592-023-02040-5 · Cited by 94
“In the field of causal inference, such a case is described as learning with both interventions and latent confounding, which remains an active area of research [27].”
Causal Discovery from Temporal Data: An Overview and New Perspectives
Gong, C., Zhang, C., Yao, D., Bi, J., Li, W., & Xu, Y. (2024) · ACM Computing Surveys · doi:10.1145/3705297 · Cited by 152
Chen, P., Song, Y., & Xia, Y. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.108256 · Cited by 56
Molecular causality in the advent of foundation models
Lobentanzer, S., Rodríguez-Mier, P., Bauer, S., & Sáez-Rodríguez, J. (2024) · Molecular Systems Biology · doi:10.1038/s44320-024-00041-w · Cited by 30
“Causal discovery is more expensive than inference both computationally and data-wise, because it involves distinguishing between correlation and causation and extracting generalisable relationships from the data (Heinze-Deml et al, 2018; Squires and Uhler, 2022).”
BackgroundInfluentialPavlović, M., Hajj, G. S. A., Kanduri, C., Pensar, J., Wood, M. E., Sollid, L. M., Greiff, V., & Sandve, G. K. (2024) · Nature Machine Intelligence · doi:10.1038/s42256-023-00781-8 · Cited by 33
Metadata
- Authors
- Squires, C., & Uhler, C.
- Affiliations
- Massachusetts Institute of Technology (US)
- Broad Institute (US)
- Corresponding author
- Squires, Chandler
- Uhler, Caroline
- Venue
- Foundations of Computational Mathematics
- Published
- 2022-08-01
- Volume
- 23
- Issue
- 5
- Pages
- 1781-1815
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- PMC
- PMC9342837
- OpenAlex
- W4289261842
- Cited by
- 31
- References
- 81
- Citations by year
- 2026: 4 · 2025: 5 · 2024: 12 · 2023: 10
- FWCI
- 2.22
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Foundations of Computational Mathematics (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
- arXiv (Cornell University)
- Funders
- Massachusetts Institute of Technology
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- causal discovery, directed acyclic graphs, search space structure, equivalence classes, observational data, interventional data, combinatorial optimization, Bayesian networks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Causal Structure Learning: A Combinatorial Perspective. https://app.cochat.ai/papers/10.1007/s10208-022-09581-9
- The paper
- Squires, C., & Uhler, C. (2023). Causal Structure Learning: A Combinatorial Perspective. Foundations of Computational Mathematics. https://doi.org/10.1007/s10208-022-09581-9
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.