Typing assumptions improve identification in causal discovery

Abstract

Causal discovery from observational data is a challenging task that can only be solved up to a set of equivalent solutions, called an equivalence class. Such classes, which are often large in size, encode uncertainties about the orientation of some edges in the causal graph. In this work, we propose a new set of assumptions that constrain possible causal relationships based on the nature of variables, thus circumscribing the equivalence class. Namely, we introduce typed directed acyclic graphs, in which variable types are used to determine the validity of causal relationships. We demonstrate, both theoretically and empirically, that the proposed assumptions can result in significant gains in the identification of the causal graph. We also propose causal discovery algorithms that make use of these assumptions and demonstrate their benefits on simulated and pseudo-real data.

arXiv comment30 pages, 13 figures, accepted for the 1st conference on Causal Learning and Reasoning (CLeaR), 2022

References in corpus (10)

• 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 Confusion in Imitation Learning
• Causality for Machine Learning
• Towards Causal Representation Learning
• Interpreting and using CPDAGs with background knowledge
• On the Equivalence of Causal Models
• Structured Priors for Structure Learning
• Formulas for Counting the Sizes of Markov Equivalence Classes of Directed Acyclic Graphs