Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding

Alexis Bellot, Mihaela van der SchaararXiv 2021 · arXiv

Introduction

Causal discovery—the process of inferring directed acyclic graphs (DAGs) from observational data—faces significant hurdles when unobserved confounders are present. These hidden variables, such as batch effects in biological experiments or market sentiment in financial data, induce spurious correlations that can lead to incorrect causal inferences. The challenge is particularly acute in cases of dense confounding, where a few latent factors influence a large proportion of the observed variables. In such scenarios, traditional methods like Maximal Ancestral Graphs (MAGs) often produce overly dense and uninformative graphs, failing to provide actionable insights for researchers.

The Deconfounded Score (DECS) Method

The Deconfounded Score (DECS) method addresses this by exploiting the "spectral footprint" left by dense confounding. The core insight is that global confounding signals tend to align with the primary directions of variance (principal components) in the data matrix. By muting these signals, the underlying causal structure can be revealed.

Conceptual transition from a latent variable model (a) to a deconfounded representation (c).

The DECS approach consists of two main stages:

  1. Spectral Adjustment: By performing Singular Value Decomposition (SVD) on the data matrix $X$, the method identifies and suppresses the largest singular values. This "spectral deconfounding" step effectively mutes the global confounding signals, which are typically orthogonal to the true causal mechanisms ($W$) according to the principle of independence of mechanisms.
  2. Score-Based Optimization: The adjusted data is then used in a continuous optimization framework. DECS employs a penalized mean squared error score combined with an algebraic constraint (the "NOTEARS" formulation) to ensure the resulting structure is a valid DAG. This allows the method to scale efficiently to high-dimensional datasets with thousands of variables.

Experimental Evaluation

The authors validated DECS using synthetic data with various noise distributions (Gaussian, Exponential, and Gumbel) and semi-synthetic benchmarks based on real-world biological networks, such as E. coli and protein signaling (Sachs dataset). To simulate real-world challenges, they removed "root" nodes from these known networks, transforming them into unobserved confounders for their children.

Key Results and Insights

DECS demonstrated superior performance across multiple metrics and settings. Notably, it maintained high accuracy even as the number of observed variables ($p$) and unobserved confounders ($q$) increased.

Performance comparison of DECS against baselines (Notears, LGES, FCI) across various noise distributions and parameters.

Key findings include:

  • Accuracy and Robustness: DECS significantly outperformed baselines like FCI and LGES in terms of Structural Hamming Distance (SHD) and Area Under the ROC Curve (AUC), particularly in high-dimensional settings ($p > n$).
  • Reproducibility: In multi-environment tests, DECS recovered consistent edges at a much higher rate (15%) than standard methods like NOTEARS (1%).
  • False Discovery Control: The method showed improved control over False Discovery Rates (FDR) in genetic data, which is crucial for practical applications where experimental validation is costly.

Discussion and Limitations

The success of DECS hinges on the principle that causal mechanisms are independent of the distribution of their parents. While highly effective for dense confounding, the method may struggle with sparse confounding, where hidden variables affect only a few nodes and thus do not appear in the top singular values. Future work may explore extensions to non-linear relationships and further refinements for identifiability in complex noise environments.

Summary updated

Abstract

Unobserved confounding is one of the greatest challenges for causal discovery. The case in which unobserved variables have a widespread effect on many of the observed ones is particularly difficult because most pairs of variables are conditionally dependent given any other subset, rendering the causal effect unidentifiable. In this paper we show that beyond conditional independencies, under the principle of independent mechanisms, unobserved confounding in this setting leaves a statistical footprint in the observed data distribution that allows for disentangling spurious and causal effects. Using this insight, we demonstrate that a sparse linear Gaussian directed acyclic graph among observed variables may be recovered approximately and propose an adjusted score-based causal discovery algorithm that may be implemented with general purpose solvers and scales to high-dimensional problems. We find, in addition, that despite the conditions we pose to guarantee causal recovery, performance in practice is robust to large deviations in model assumptions.
BibTeX
@misc{bellot2021deconfounded,
  author = {Alexis Bellot and Mihaela van der Schaar},
  title = {{Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding}},
  year = {2021},
  eprint = {2103.15106},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2103.15106},
}
Figure