AIMEOct 29, 2019

Efficient Identification in Linear Structural Causal Models with Instrumental Cutsets

arXiv:1910.13493v113 citations
Originality Incremental advance
AI Analysis

This work addresses the computational inefficiency in causal inference for researchers and practitioners, offering a novel efficient method that is incremental over existing approaches.

The paper tackles the problem of efficiently identifying causal effects in linear structural causal models by developing a new criterion called Instrumental Cutsets, which solves for parameters missed by other polynomial-time algorithms and proves that determining identifiability with a more powerful method is NP-Complete.

One of the most common mistakes made when performing data analysis is attributing causal meaning to regression coefficients. Formally, a causal effect can only be computed if it is identifiable from a combination of observational data and structural knowledge about the domain under investigation (Pearl, 2000, Ch. 5). Building on the literature of instrumental variables (IVs), a plethora of methods has been developed to identify causal effects in linear systems. Almost invariably, however, the most powerful such methods rely on exponential-time procedures. In this paper, we investigate graphical conditions to allow efficient identification in arbitrary linear structural causal models (SCMs). In particular, we develop a method to efficiently find unconditioned instrumental subsets, which are generalizations of IVs that can be used to tame the complexity of many canonical algorithms found in the literature. Further, we prove that determining whether an effect can be identified with TSID (Weihs et al., 2017), a method more powerful than unconditioned instrumental sets and other efficient identification algorithms, is NP-Complete. Finally, building on the idea of flow constraints, we introduce a new and efficient criterion called Instrumental Cutsets (IC), which is able to solve for parameters missed by all other existing polynomial-time algorithms.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes