Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
From MaRDI portal
Publication:5405195
zbMATH Open1433.68346arXiv1104.2808MaRDI QIDQ5405195FDOQ5405195
Publication date: 1 April 2014
Abstract: The investigation of directed acyclic graphs (DAGs) encoding the same Markov property, that is the same conditional independence relations of multivariate observational distributions, has a long tradition; many algorithms exist for model selection and structure learning in Markov equivalence classes. In this paper, we extend the notion of Markov equivalence of DAGs to the case of interventional distributions arising from multiple intervention experiments. We show that under reasonable assumptions on the intervention experiments, interventional Markov equivalence defines a finer partitioning of DAGs than observational Markov equivalence and hence improves the identifiability of causal models. We give a graph theoretic criterion for two DAGs being Markov equivalent under interventions and show that each interventional Markov equivalence class can, analogously to the observational case, be uniquely represented by a chain graph called interventional essential graph (also known as CPDAG in the observational case). These are key insights for deriving a generalization of the Greedy Equivalence Search algorithm aimed at structure learning from interventional data. This new algorithm is evaluated in a simulation study.
Full work available at URL: https://arxiv.org/abs/1104.2808
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)
Cited In (37)
- Bayesian learning of multiple directed networks from observational data
- Two optimal strategies for active learning of causal models from interventional data
- Sound and complete causal identification with latent variables given local background knowledge
- A survey on causal discovery: theory and practice
- Title not available (Why is that?)
- Compatible priors for model selection of high-dimensional Gaussian DAGs
- Reconstruction of a directed acyclic graph with intervention
- Tests for differential Gaussian Bayesian networks based on quadratic inference functions
- High-dimensional consistency in score-based and hybrid structure learning
- Objective Bayes model selection of Gaussian interventional essential graphs for the identification of signaling pathways
- Causal statistical inference in high dimensions
- Switching Regression Models and Causal Inference in the Presence of Discrete Latent Variables
- Bayesian sample size determination for causal discovery
- A local method for identifying causal relations under Markov equivalence
- Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
- Equivalence class selection of categorical graphical models
- High-dimensional joint estimation of multiple directed Gaussian graphical models
- Greedy Causal Discovery Is Geometric
- When causality meets fairness: a survey
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data
- Network Structure Learning Under Uncertain Interventions
- Bayesian graphical modeling for heterogeneous causal effects
- Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
- Title not available (Why is that?)
- Consistent causal inference from time series with PC algorithm and its time-aware extension
- Fast causal orientation learning in directed acyclic graphs
- Marginal integration for nonparametric causal inference
- Bayesian optimal experimental design for inferring causal structure
- Causal structure learning: a combinatorial perspective
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Improved baselines for causal structure learning on interventional data
- Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data
- Title not available (Why is that?)
- Invariant Causal Prediction for Sequential Data
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Title not available (Why is that?)
This page was built for publication: Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405195)
