PAG2ADMG: An Algorithm for the Complete Causal Enumeration of a Markov Equivalence Class
Causal graphs, such as directed acyclic graphs (DAGs) and partial ancestral graphs (PAGs), represent causal relationships among variables in a model. Methods exist for learning DAGs and PAGs from data and for converting DAGs to PAGs. However, these methods are significantly limited in that they only output a single causal graph consistent with the independencies and dependencies (the Markov equivalence class $M$) estimated from the data. This is problematic and insufficient because many distinct graphs may be consistent with $M$. A data modeler may wish to select among these numerous consistent graphs using domain knowledge or other model selection algorithms. Enumeration of the set of consistent graphs is the bottleneck. In this paper, we present a method that makes this desired enumeration possible. We introduce PAG2ADMG, the first algorithm for enumerating all causal graphs consistent with $M$. PAG2ADMG converts a given PAG into the complete set of acyclic directed mixed graphs (ADMGs) consistent with $M$. We prove the correctness of the approach and demonstrate its efficiency relative to brute-force enumeration.
Code (0)
등록된 구현이 없습니다.
Tasks
Model SelectionSimilar Papers 제목 키워드 기반
Identifying Macro Causal Effects in C-DMGs over DMGs
The do-calculus is a sound and complete tool for identifying causal effects in acyclic directed mixed graphs (ADMGs) induced by structural causal models (SCMs). However, in many real-world applications, especially in hig…
Differentiable Causal Discovery Under Unmeasured Confounding
The data drawn from biological, economic, and social systems are often confounded due to the presence of unmeasured variables. Prior work in causal discovery has focused on discrete search procedures for selecting acycli…
Causal DiscoveryCausal Reasoning in the Presence of Latent Confounders via Neural ADMG Learning
Latent confounding has been a long-standing obstacle for causal reasoning from observational data. One popular approach is to model the data using acyclic directed mixed graphs (ADMGs), which describe ancestral relations…
Integer Programming for Causal Structure Learning in the Presence of Latent Variables
The problem of finding an ancestral acyclic directed mixed graph (ADMG) that represents the causal relationships between a set of variables is an important area of research on causal inference. Most existing score-based …
Causal InferencevalidBeyond Additivity: Causal Discovery in Location-Scale Noise Models with Hidden Variables
We study causal discovery from observational data when some variables are hidden and the data-generating process follows a location-scale noise model (LSNM). Existing methods that handle hidden confounders typically assu…