Table of Contents
Fetching ...

Efficient Latent Variable Causal Discovery: Combining Score Search and Targeted Testing

Joseph Ramsey, Bryan Andrews, Peter Spirtes

TL;DR

The paper tackles latent-variable causal discovery under selection bias, where standard CI-based methods like FCI suffer from repeated testing and instability under near-unfaithfulness. It introduces a spectrum of methods: BOSS-FCI and GRaSP-FCI as score-guided hybrids within the GFCI framework, LV-Dumb as a fast structural baseline, and FCIT as a targeted-testing refinement that uses recursive path blocking to identify separating sets with far fewer CI tests while guaranteeing well-formed PAGs. Theoretical guarantees cover correctness, edge-minimality, and orientation soundness (with optional full completeness if all Zhang rules are applied), and empirically FCIT achieves best balance of precision, efficiency, and structural validity across simulations and real data; LV-Dumb offers a fast, practical alternative, while BOSS-FCI/GRaSP-FCI provide robust baselines. Together, these methods advance scalable, reliable causal discovery in the presence of latent confounding, with practical implications for large-scale datasets and diverse domains.

Abstract

Learning causal structure from observational data is especially challenging when latent variables or selection bias are present. The Fast Causal Inference (FCI) algorithm addresses this setting but performs exhaustive conditional independence tests across many subsets, often leading to spurious independences, missing or extra edges, and unreliable orientations. We present a family of score-guided mixed-strategy causal search algorithms that extend this framework. First, we introduce BOSS-FCI and GRaSP-FCI, variants of GFCI (Greedy Fast Causal Inference) that substitute BOSS (Best Order Score Search) or GRaSP (Greedy Relaxations of Sparsest Permutation) for FGES (Fast Greedy Equivalence Search), preserving correctness while trading off scalability and conservativeness. Second, we develop FCI Targeted-Testing (FCIT), a novel hybrid method that replaces exhaustive testing with targeted, score-informed tests guided by BOSS. FCIT guarantees well-formed PAGs and achieves higher precision and efficiency across sample sizes. Finally, we propose a lightweight heuristic, LV-Dumb (Latent Variable "Dumb"), which returns the PAG of the BOSS DAG (Directed Acyclic Graph). Though not strictly sound for latent confounding, LV-Dumb often matches FCIT's accuracy while running substantially faster. Simulations and real-data analyses show that BOSS-FCI and GRaSP-FCI provide robust baselines, FCIT yields the best balance of precision and reliability, and LV-Dumb offers a fast, near-equivalent alternative. Together, these methods demonstrate that targeted and score-guided strategies can dramatically improve the efficiency and correctness of latent-variable causal discovery.

Efficient Latent Variable Causal Discovery: Combining Score Search and Targeted Testing

TL;DR

The paper tackles latent-variable causal discovery under selection bias, where standard CI-based methods like FCI suffer from repeated testing and instability under near-unfaithfulness. It introduces a spectrum of methods: BOSS-FCI and GRaSP-FCI as score-guided hybrids within the GFCI framework, LV-Dumb as a fast structural baseline, and FCIT as a targeted-testing refinement that uses recursive path blocking to identify separating sets with far fewer CI tests while guaranteeing well-formed PAGs. Theoretical guarantees cover correctness, edge-minimality, and orientation soundness (with optional full completeness if all Zhang rules are applied), and empirically FCIT achieves best balance of precision, efficiency, and structural validity across simulations and real data; LV-Dumb offers a fast, practical alternative, while BOSS-FCI/GRaSP-FCI provide robust baselines. Together, these methods advance scalable, reliable causal discovery in the presence of latent confounding, with practical implications for large-scale datasets and diverse domains.

Abstract

Learning causal structure from observational data is especially challenging when latent variables or selection bias are present. The Fast Causal Inference (FCI) algorithm addresses this setting but performs exhaustive conditional independence tests across many subsets, often leading to spurious independences, missing or extra edges, and unreliable orientations. We present a family of score-guided mixed-strategy causal search algorithms that extend this framework. First, we introduce BOSS-FCI and GRaSP-FCI, variants of GFCI (Greedy Fast Causal Inference) that substitute BOSS (Best Order Score Search) or GRaSP (Greedy Relaxations of Sparsest Permutation) for FGES (Fast Greedy Equivalence Search), preserving correctness while trading off scalability and conservativeness. Second, we develop FCI Targeted-Testing (FCIT), a novel hybrid method that replaces exhaustive testing with targeted, score-informed tests guided by BOSS. FCIT guarantees well-formed PAGs and achieves higher precision and efficiency across sample sizes. Finally, we propose a lightweight heuristic, LV-Dumb (Latent Variable "Dumb"), which returns the PAG of the BOSS DAG (Directed Acyclic Graph). Though not strictly sound for latent confounding, LV-Dumb often matches FCIT's accuracy while running substantially faster. Simulations and real-data analyses show that BOSS-FCI and GRaSP-FCI provide robust baselines, FCIT yields the best balance of precision and reliability, and LV-Dumb offers a fast, near-equivalent alternative. Together, these methods demonstrate that targeted and score-guided strategies can dramatically improve the efficiency and correctness of latent-variable causal discovery.

Paper Structure

This paper contains 64 sections, 13 theorems, 16 equations, 44 figures, 5 tables, 11 algorithms.

Key Result

Theorem 1

Let $x \neq y$ be distinct measured vertices in a graph $G$, where $G$ is a PAG (or, more generally, a MAG or DAG) interpreted under $m$-separation. Let $\mathit{block\_paths\_recursively}(x,y,C,\mathbf{F})$ denote Algorithm alg:block_paths_recursively. If the algorithm halts and returns a blocking

Figures (44)

  • Figure 1: Adjacency Precision (AP) for 20-node graphs with average degree 4. All algorithms maintain very high adjacency precision across sample sizes. LV-Dumb trails slightly. LV-Dumb is slightly lower than the others but remains acceptable.
  • Figure 2: Adjacency Recall (AR) for 20-node graphs with average degree 4. LV-Dumb and FCIT achieve the highest recall across all sample sizes, reflecting their ability to recover true adjacencies even in the presence of latent confounding. BOSS-FCI, GRaSP-FCI, GFCI, and FCI improve steadily with $N$. Results are averaged over graphs with 0, 4, and 8 latent common causes.
  • Figure 3: Arrowhead Precision (AHP) for 20-node graphs with average degree 4. LV-Dumb and FCIT maintain the highest precision, followed by BOSS-FCI and GRaSP-FCI. FCI remains lowest throughout, while GFCI improves moderately at large $N$. Results are averaged over graphs with 0, 4, and 8 latent common causes.
  • Figure 4: Arrowhead Recall (AHR) for 20-node graphs with average degree 4. FCIT and LV-Dumb show the strongest growth in recall with increasing $N$, approaching 0.6 at large $N$. BOSS-FCI, GFCI, and GRaSP-FCI track closely, while GFCI remains lower overall. Results are averaged over graphs with 0, 4, and 8 latent common causes.
  • Figure 5: Arrowhead Precision for Common Adjacencies (AHPC) for 20-node graphs with average degree 4. LV-Dumb and FCIT achieve the highest arrowhead precision, with LV-Dumb reaching 0.92 at large $N$. BOSS-FCI and GRaSP-FCI show similar trends, while GFCI and especially FCI remain lower. Results are averaged over graphs with 0, 4, and 8 latent common causes.
  • ...and 39 more figures

Theorems & Definitions (21)

  • Definition 1: Repeated Testing Problem
  • Theorem 1: Soundness of Recursive Blocking
  • Corollary 1: Adjacency Case
  • Lemma 1: RB completeness over $\boldsymbol{\mathcal{S}}$
  • Theorem 2: Edge-Minimality
  • Theorem 3: Orientation Soundness
  • Theorem 4: Orientation Completeness
  • Corollary 2
  • Definition 2: Pre-discriminating and discriminating paths
  • Theorem 5: Soundness of Recursive Blocking
  • ...and 11 more