Constraint-based causal discovery with tiered background knowledge and latent variables in single or overlapping datasets
In this paper we consider the use of tiered background knowledge within constraint based causal discovery. Our focus is on settings relaxing causal sufficiency, i.e. allowing for latent variables which may arise because relevant information could not be measured at all, or not jointly, as in the case of multiple overlapping datasets. We first present novel insights into the properties of the 'tiered FCI' (tFCI) algorithm. Building on this, we introduce a new extension of the IOD (integrating overlapping datasets) algorithm incorporating tiered background knowledge, the 'tiered IOD' (tIOD) algorithm. We show that under full usage of the tiered background knowledge tFCI and tIOD are sound, while simple versions of the tIOD and tFCI are sound and complete. We further show that the tIOD algorithm can often be expected to be considerably more efficient and informative than the IOD algorithm even beyond the obvious restriction of the Markov equivalence classes. We provide a formal result on the conditions for this gain in efficiency and informativeness. Our results are accompanied by a series of examples illustrating the exact role and usefulness of tiered background knowledge.
Code (0)
등록된 구현이 없습니다.
Tasks
Causal DiscoveryInformativenessMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Cluster-Dags as Powerful Background Knowledge For Causal Discovery
Finding cause-effect relationships is of key importance in science. Causal discovery aims to recover a graph from data that succinctly describes these cause-effect relationships. However, current methods face several cha…
Improving Finite Sample Performance of Causal Discovery by Exploiting Temporal Structure
Methods of causal discovery aim to identify causal structures in a data driven way. Existing algorithms are known to be unstable and sensitive to statistical errors, and are therefore rarely used with biomedical or epide…
Causal DiscoveryDo we become wiser with time? On causal equivalence with tiered background knowledge
Equivalence classes of DAGs (represented by CPDAGs) may be too large to provide useful causal information. Here, we address incorporating tiered background knowledge yielding restricted equivalence classes represented by…
Computational EfficiencyInformativenessvalidIntegrating Background Knowledge for Scalable Causal Discovery
Expert background knowledge is often available in practical applications of causal discovery. Such constraints on the true causal graph can help causal discovery in terms of identifiability of causal effects and accuracy…
Causal ASCEND: Scalable Two-tier Causal Discovery on High Dimensional Multi-omics Data
Biological systems exhibit a hierarchical structure, characterised by directed flow from upstream regulators to downstream effects. Although this ordering provides a natural scaffold for causal inference, most causal dis…
Computational EfficiencyCausal Inference