A Local Method for Identifying Causal Relations under Markov Equivalence
- URL: http://arxiv.org/abs/2102.12685v1
- Date: Thu, 25 Feb 2021 05:01:44 GMT
- Title: A Local Method for Identifying Causal Relations under Markov Equivalence
- Authors: Zhuangyan Fang and Yue Liu and Zhi Geng and Yangbo He
- Abstract summary: 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 based on causal graphical models of directed acyclic graphs (DAGs)
- Score: 7.904790547594697
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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 based on 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
the variable is a cause/non-cause of the target. Finally, we propose a local
learning algorithm for this causal query via learning 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.
Related papers
- DCDILP: a distributed learning method for large-scale causal structure learning [4.551283926017506]
This paper presents a novel approach to causal discovery through a divide-and-conquer framework.
By decomposing the problem into smaller subproblems defined on Markov blankets, the proposed DCDILP method first explores in parallel the local causal graphs of these subproblems.
arXiv Detail & Related papers (2024-06-15T03:17:48Z) - Score-based Causal Representation Learning: Linear and General
Transformations [35.82689499120426]
The paper addresses both the identifiability and achievability aspects.
It designs a score-based class of algorithms that ensures both identifiability and achievability.
arXiv Detail & Related papers (2024-02-01T18:40:03Z) - General Identifiability and Achievability for Causal Representation
Learning [33.80247458590611]
The paper establishes identifiability and achievability results using two hard uncoupled interventions per node in the latent causal graph.
For identifiability, the paper establishes that perfect recovery of the latent causal model and variables is guaranteed under uncoupled interventions.
The analysis, additionally, recovers the identifiability result for two hard coupled interventions, that is when metadata about the pair of environments that have the same node intervened is known.
arXiv Detail & Related papers (2023-10-24T01:47:44Z) - Structural restrictions in local causal discovery: identifying direct
causes of a target variable [0.0]
We consider the problem of learning a set of direct causes of a target variable from an observational joint distribution.
We provide two practical algorithms for estimating the direct causes from a finite random sample and demonstrate their effectiveness on several benchmark datasets.
arXiv Detail & Related papers (2023-07-29T18:31:35Z) - Learning to Bound Counterfactual Inference in Structural Causal Models
from Observational and Randomised Data [64.96984404868411]
We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm.
The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources.
It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
arXiv Detail & Related papers (2022-12-06T12:42:11Z) - Relation Matters: Foreground-aware Graph-based Relational Reasoning for
Domain Adaptive Object Detection [81.07378219410182]
We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR)
FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations.
Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
arXiv Detail & Related papers (2022-06-06T05:12:48Z) - Effect Identification in Cluster Causal Diagrams [51.42809552422494]
We introduce a new type of graphical model called cluster causal diagrams (for short, C-DAGs)
C-DAGs allow for the partial specification of relationships among variables based on limited prior knowledge.
We develop the foundations and machinery for valid causal inferences over C-DAGs.
arXiv Detail & Related papers (2022-02-22T21:27:31Z) - Scalable Intervention Target Estimation in Linear Models [52.60799340056917]
Current approaches to causal structure learning either work with known intervention targets or use hypothesis testing to discover the unknown intervention targets.
This paper proposes a scalable and efficient algorithm that consistently identifies all intervention targets.
The proposed algorithm can be used to also update a given observational Markov equivalence class into the interventional Markov equivalence class.
arXiv Detail & Related papers (2021-11-15T03:16:56Z) - Typing assumptions improve identification in causal discovery [123.06886784834471]
Causal discovery from observational data is a challenging task to which an exact solution cannot always be identified.
We propose a new set of assumptions that constrain possible causal relationships based on the nature of the variables.
arXiv Detail & Related papers (2021-07-22T14:23:08Z) - Variational Causal Networks: Approximate Bayesian Inference over Causal
Structures [132.74509389517203]
We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs.
In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
arXiv Detail & Related papers (2021-06-14T17:52:49Z) - A Recursive Markov Boundary-Based Approach to Causal Structure Learning [22.38302412440357]
We propose a novel recursion-based method for causal structure learning.
It significantly reduces the required number of conditional independence tests.
Our experimental results show that the proposed algorithm outperforms state-of-the-art both on synthetic and real-world structures.
arXiv Detail & Related papers (2020-10-10T13:26:22Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.