Table of Contents
Fetching ...

dcFCI: Robust Causal Discovery Under Latent Confounding, Unfaithfulness, and Mixed Data

Adèle H. Ribeiro, Dominik Heider

TL;DR

This work tackles robust causal discovery under latent confounding and empirical unfaithfulness by introducing a nonparametric, data-type-agnostic PAG compatibility score and the dcFCI algorithm. dcFCI fuses MEC-consistent search with a MEC-targeted, Bayesian-style data compatibility assessment to jointly address latent confounding, unfaithfulness, and mixed data types, outputting top PAGs with quantified uncertainty. Across synthetic Gaussian and mixed-type simulations, as well as a real-world DHID application, dcFCI consistently outperforms state-of-the-art methods in PAG validity, true PAG recovery, and data compatibility, particularly in small or heterogeneous datasets. This approach enables more robust, interpretable causal reasoning and supports downstream analyses by offering uncertainty-aware, data-aligned causal structures.

Abstract

Causal discovery is central to inferring causal relationships from observational data. In the presence of latent confounding, algorithms such as Fast Causal Inference (FCI) learn a Partial Ancestral Graph (PAG) representing the true model's Markov Equivalence Class. However, their correctness critically depends on empirical faithfulness, the assumption that observed (in)dependencies perfectly reflect those of the underlying causal model, which often fails in practice due to limited sample sizes. To address this, we introduce the first nonparametric score to assess a PAG's compatibility with observed data, even with mixed variable types. This score is both necessary and sufficient to characterize structural uncertainty and distinguish between distinct PAGs. We then propose data-compatible FCI (dcFCI), the first hybrid causal discovery algorithm to jointly address latent confounding, empirical unfaithfulness, and mixed data types. dcFCI integrates our score into an (Anytime)FCI-guided search that systematically explores, ranks, and validates candidate PAGs. Experiments on synthetic and real-world scenarios demonstrate that dcFCI significantly outperforms state-of-the-art methods, often recovering the true PAG even in small and heterogeneous datasets. Examining top-ranked PAGs further provides valuable insights into structural uncertainty, supporting more robust and informed causal reasoning and decision-making.

dcFCI: Robust Causal Discovery Under Latent Confounding, Unfaithfulness, and Mixed Data

TL;DR

This work tackles robust causal discovery under latent confounding and empirical unfaithfulness by introducing a nonparametric, data-type-agnostic PAG compatibility score and the dcFCI algorithm. dcFCI fuses MEC-consistent search with a MEC-targeted, Bayesian-style data compatibility assessment to jointly address latent confounding, unfaithfulness, and mixed data types, outputting top PAGs with quantified uncertainty. Across synthetic Gaussian and mixed-type simulations, as well as a real-world DHID application, dcFCI consistently outperforms state-of-the-art methods in PAG validity, true PAG recovery, and data compatibility, particularly in small or heterogeneous datasets. This approach enables more robust, interpretable causal reasoning and supports downstream analyses by offering uncertainty-aware, data-aligned causal structures.

Abstract

Causal discovery is central to inferring causal relationships from observational data. In the presence of latent confounding, algorithms such as Fast Causal Inference (FCI) learn a Partial Ancestral Graph (PAG) representing the true model's Markov Equivalence Class. However, their correctness critically depends on empirical faithfulness, the assumption that observed (in)dependencies perfectly reflect those of the underlying causal model, which often fails in practice due to limited sample sizes. To address this, we introduce the first nonparametric score to assess a PAG's compatibility with observed data, even with mixed variable types. This score is both necessary and sufficient to characterize structural uncertainty and distinguish between distinct PAGs. We then propose data-compatible FCI (dcFCI), the first hybrid causal discovery algorithm to jointly address latent confounding, empirical unfaithfulness, and mixed data types. dcFCI integrates our score into an (Anytime)FCI-guided search that systematically explores, ranks, and validates candidate PAGs. Experiments on synthetic and real-world scenarios demonstrate that dcFCI significantly outperforms state-of-the-art methods, often recovering the true PAG even in small and heterogeneous datasets. Examining top-ranked PAGs further provides valuable insights into structural uncertainty, supporting more robust and informed causal reasoning and decision-making.
Paper Structure (35 sections, 7 theorems, 14 equations, 6 figures, 25 tables, 1 algorithm)

This paper contains 35 sections, 7 theorems, 14 equations, 6 figures, 25 tables, 1 algorithm.

Key Result

Proposition 1

Let $\mathbf{Z} \in \operatorname{MinSep}_{\mathcal{P}^{(r)}}(X,Y)$. For every $Z_i \in \mathbf{Z}$, there exist nodes $(X',Y')$, possibly equal to $(X,Y)$, and $\mathbf{Z}' \in \operatorname{MinSep}_{\mathcal{P}^{(r)}}(X',Y')$ such that $Z_i \in \mathbf{Z}'$ and $\langle X', Z_i, Y' \rangle$ is a n

Figures (6)

  • Figure 1: True causal diagram (a) and PAG (b) compared with PAGs inferred by SOTA algorithms: FCI (c), cFCI and GPS (d), BCCD (e), and DCD (f).
  • Figure 2: All candidate $r$-PAGs generated by dcFCI in Example 1 for $r = 0, 1, 2$. (a) initial PAG $\mathcal{P}^{(-1)}$ and 0-PAG $\mathcal{P}_1^{(0)}$, implying the set of (conditional) independencies $\mathscr{I}^{(-1)} = \mathscr{I}_1^{(0)} = \emptyset$; (b) $\mathcal{P}_2^{(0)}$, $\mathcal{P}_1^{(1)}$, and $\mathcal{P}_1^{(2)}$, implying $\mathscr{I}_2^{(0)} = \mathscr{I}_1^{(1)} = \mathscr{I}_1^{(2)} = {(B \mathbin{ {$⊥$} {$=$} {$$} {} } X)}$; (c)-(e) 1-PAGs $\mathcal{P}_2^{(1)}$, $\mathcal{P}_3^{(1)}$, and $\mathcal{P}_4^{(1)}$, derived from $\mathcal{P}_2^{(0)}$, implying, respectively, $\mathscr{I}_2^{(1)} = \mathscr{I}_2^{(0)} \cup {(X \mathbin{ {$⊥$} {$=$} {$$} {} } Y | A)}$, $\mathscr{I}_3^{(1)} = \mathscr{I}_2^{(0)} \cup {(A \mathbin{ {$⊥$} {$=$} {$$} {} } Y | X)}$, and $\mathscr{I}_4^{(1)} = \mathscr{I}_2^{(0)} \cup {(X \mathbin{ {$⊥$} {$=$} {$$} {} } Y | A), (A \mathbin{ {$⊥$} {$=$} {$$} {} } Y | X)}$; (f) 2-PAG $\mathcal{P}_2^{(2)}$, derived from $\mathcal{P}_1^{(1)}$, with $\mathscr{I}_2^{(2)} = \mathscr{I}_1^{(1)} \cup {(X \mathbin{ {$⊥$} {$=$} {$$} {} } Y | A, B)}$, representing dcFCI’s optimal and true PAG.
  • Figure 3: dcFCI, FCI, and cFCI agree on the inferred PAGs (a) and (b). In (a), physical activity (PhysActivity), BMI, and smoking status (Smoker) are causal contributors to HighBP. In (b), heart disease or myocardial infarction (HeartDiseaseorAttack) and education causal contributors to stroke.
  • Figure 4: Comparison of PAGs learned by dcFCI (left), FCI (center), and cFCI (right) for five variables: HighBP, Sex, Income, Smoker, and HvyAlcoholComsump. dcFCI inferred PAGs with higher compatibility scores (bounds: (a) [0, 0.0209], (d) [0, 0.0155], (g) [0, 0.0249]) compared to FCI ((b) [0, 0.0119], (e) [0, 0.0134], (h) [0, 0.00892]). cFCI yields invalid PAGs in two cases ((f) and (i)), with one valid result (c) $[0, 2.82 × 10^{-10}]$.
  • Figure 5: Comparison of PAGs learned by dcFCI (left), FCI (center), and cFCI (right) for five variables: Stroke, BMI, HighChol, HeartDiseaseorAttack, and HvyAlcoholComsump. dcFCI inferred PAGs with higher compatibility scores (bounds: (a) [0, 0.0302], (d) [0, 0.00976], (g) [0, 0.00795]) compared to FCI ((b) [0, 0.0099], (e) [0, 0.00955], (h) [0, 0.00672]). cFCI yields invalid PAGs in two cases ((c) and (i)), with one valid result (f) [0, 0.00955].
  • ...and 1 more figures

Theorems & Definitions (22)

  • Definition 1: Data-PAG Compatibility
  • Definition 2
  • Remark 1
  • Definition 3
  • Definition 4
  • Proposition 1
  • Proposition 2
  • Definition 5
  • Theorem 1: Score Completeness
  • Corollary 1: Score Equivalence
  • ...and 12 more