Causal Structure Learning: a Combinatorial Perspective
arXiv:2206.01152 · doi:10.1007/s10208-022-09581-9
Abstract
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 (DAGs) 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.
References in corpus (10)
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- CAM: Causal additive models, high-dimensional order search and penalized regression
- Identifiability of Gaussian structural equation models with equal error variances
- Geometry of the faithfulness assumption in causal inference
- Two Optimal Strategies for Active Learning of Causal Models from Interventional Data
- Foundations of Structural Causal Models with Cycles and Latent Variables
- Graphs for margins of Bayesian networks
- Partition MCMC for inference on acyclic digraphs
- Margins of discrete Bayesian networks
- Probability distributions with summary graph structure