Discovery and inference of a causal network with hidden confounding

Abstract

This article proposes a novel causal discovery and inference method called GrIVET for a Gaussian directed acyclic graph with unmeasured confounders. GrIVET consists of an order-based causal discovery method and a likelihood-based inferential procedure. For causal discovery, we generalize the existing peeling algorithm to estimate the ancestral relations and candidate instruments in the presence of hidden confounders. Based on this, we propose a new procedure for instrumental variable estimation of each direct effect by separating it from any mediation effects. For inference, we develop a new likelihood ratio test of multiple causal effects that is able to account for the unmeasured confounders. Theoretically, we prove that the proposed method has desirable guarantees, including robustness to invalid instruments and uncertain interventions, estimation consistency, low-order polynomial time complexity, and validity of asymptotic inference. Numerically, GrIVET performs well and compares favorably against state-of-the-art competitors. Furthermore, we demonstrate the utility and effectiveness of the proposed method through an application inferring regulatory pathways from Alzheimer's disease gene expression data.

arXiv comment27 pages, 4 figures, 3 tables. The manuscript is accepted by Journal of the American Statistical Association

References in corpus (18)

• High-dimensional graphs and variable selection with the Lasso
• Simultaneous analysis of Lasso and Dantzig selector
• Valid post-selection inference
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• Identifiability of Gaussian structural equation models with equal error variances
• DAGs with NO TEARS: Continuous Optimization for Structure Learning
• Penalized Estimation of Directed Acyclic Graphs From Discrete Data
• Nonlinear Causal Discovery with Confounders
• Estimating causal structure using conditional DAG models
• FedDAG: Federated DAG Structure Learning
• Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Game
• Inference for Individual Mediation Effects and Interventional Effects in Sparse High-Dimensional Causal Graphical Models
• Naïve regression requires weaker assumptions than factor models to adjust for multiple cause confounding
• A Two-Stage Penalized Least Squares Method for Constructing Large Systems of Structural Equations
• Inference for a Large Directed Acyclic Graph with Unspecified Interventions
• Learning linear structural equation models in polynomial time and sample complexity
• Learning linear non-Gaussian directed acyclic graph with diverging number of nodes
• Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families