A Local Method for Identifying Causal Relations under Markov Equivalence
arXiv:2102.12685 · doi:10.1016/j.artint.2022.103669
Abstract
Causality is important for designing interpretable and robust methods in artificial intelligence research. We propose a local approach to identify whether a variable is a cause of a given target under the framework of causal graphical models of directed acyclic graphs (DAGs). In general, the causal relation between two variables may not be identifiable from observational data as many causal DAGs encoding different causal relations are Markov equivalent. In this paper, we first introduce a sufficient and necessary graphical condition to check the existence of a causal path from a variable to a target in every Markov equivalent DAG. Next, we provide local criteria for identifying whether a variable is a cause/non-cause of a target based only on the local structure instead of the entire graph. Finally, we propose a local learning algorithm for this causal query via learning the local structure of the variable and some additional statistical independence tests related to the target. Simulation studies show that our local algorithm is efficient and effective, compared with other state-of-art methods.
References in corpus (22)
- Counterfactual Fairness
- Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (1995)
- Deep Recurrent Quantization for Generating Sequential Binary Codes
- Beyond Product Quantization: Deep Progressive Quantization for Image Retrieval
- Causal Inference and Causal Explanation with Background Knowledge
- Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (1999)
- Estimating high-dimensional intervention effects from observational data
- On the Identifiability of the Post-Nonlinear Causal Model
- Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
- Identifiability of Gaussian structural equation models with equal error variances
- DAGs with NO TEARS: Continuous Optimization for Structure Learning
- Causal Discovery with Continuous Additive Noise Models
- Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence (2011)
- A generalized back-door criterion
- Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (2005)
- On efficient adjustment in causal graphs
- Domain Adaptation as a Problem of Inference on Graphical Models
- Interpreting and using CPDAGs with background knowledge
- A Logical Characterization of Constraint-Based Causal Discovery
- On sampling graphical Markov models
- Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables
- Identifying causal effects in maximally oriented partially directed acyclic graphs