Causal structure learning: a combinatorial perspective
From MaRDI portal
Publication:6072331
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.
Cites work
- scientific article; zbMATH DE number 6378135 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- scientific article; zbMATH DE number 7255130 (Why is no real title available?)
- scientific article; zbMATH DE number 7306884 (Why is no real title available?)
- scientific article; zbMATH DE number 6276218 (Why is no real title available?)
- scientific article; zbMATH DE number 6542823 (Why is no real title available?)
- 10.1162/153244303321897717
- A linear non-Gaussian acyclic model for causal discovery
- Active learning of causal networks with intervention experiments and optimal designs
- An efficient algorithm for counting Markov equivalent DAGs
- Ancestral graph Markov models.
- Bayesian Graphical Models for Discrete Data
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- CAM: causal additive models, high-dimensional order search and penalized regression
- Causality. Models, reasoning, and inference
- Causation, prediction, and search
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Consistency guarantees for greedy permutation-based causal inference algorithms
- Counting Markov equivalence classes for DAG models on trees
- Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
- DirectLiNGAM: a direct method for learning a linear non-Gaussian structural equation model
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
- Elements of causal inference. Foundations and learning algorithms
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Exact Bayesian structure discovery in Bayesian networks
- Experiment selection for causal discovery
- External validity: from do-calculus to transportability across populations
- Foundations of structural causal models with cycles and latent variables
- Geometry of the faithfulness assumption in causal inference
- Graphs for margins of Bayesian networks
- Greedy Causal Discovery Is Geometric
- Handbook of Graphical Models
- High-dimensional causal discovery under non-Gaussianity
- High-dimensional consistency in score-based and hybrid structure learning
- Identifiability of Gaussian structural equation models with equal error variances
- Improving Markov chain Monte Carlo model search for data mining
- Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
- Integer linear programming for the Bayesian network structure learning problem
- Learning Causal Bayesian Network Structures From Experimental Data
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Learning optimal Bayesian networks: a shortest path perspective
- Marginalizing and conditioning in graphical models
- Margins of discrete Bayesian networks
- Nested Markov properties for acyclic directed mixed graphs
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- PC algorithm for nonparanormal graphical models
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- Probability distributions with summary graph structure
- Right Singular Vector Projection Graphs: Fast High Dimensional Covariance Matrix Estimation under Latent Confounding
- Robust Causal Structure Learning with Some Hidden Variables
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Structure discovery in Bayesian networks by sampling partial orders
- The Hardness of Conditional Independence Testing and the Generalised Covariance Measure
- The max-min hill-climbing Bayesian network structure learning algorithm
- The three faces of faithfulness
- Two optimal strategies for active learning of causal models from interventional data
- Unifying Markov properties for graphical models
Cited in
(11)- Learning directed acyclic graphs by determination of candidate causes for discrete variables
- DAGs as minimal \(\mathcal{I} \)-maps for the induced models of causal Bayesian networks under conditioning
- A formal approach to using data distributions for building causal polytree structures
- Causal learning with Occam's razor
- Are there algorithms that discover causal structure?
- Causal Structural Learning via Local Graphs
- Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization
- Learning Neighborhoods of High Confidence in Constraint-Based Causal Discovery
- Robust Causal Structure Learning with Some Hidden Variables
- Fast causal orientation learning in directed acyclic graphs
- Streaming feature-based causal structure learning algorithm with symmetrical uncertainty
This page was built for publication: Causal structure learning: a combinatorial perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072331)
