Efficient Latent Variable Causal Discovery: Combining Score Search and Targeted Testing
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 18 references that are in the map. First posted on arXiv 5 Oct 2025.
Builds on
6 of 18 references.
References · 6
- 2022Greedy Relaxations of the Sparsest Permutation Algorithmcited by 63
- 2020Differentiable Causal Discovery Under Unmeasured Confoundingcited by 56
- 2023Fast Scalable and Accurate Discovery of DAGs Using the Best Order Score Search and Grow-Shrink Treescited by 38
- 2015A Uniformly Consistent Estimator of Causal Effects under the k-Triangle-Faithfulness Assumptioncited by 10
- 2024A fast score-based search algorithm for maximal ancestral graphs using entropycited by 3
- 2025The causal structure of galactic astrophysicscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026DKCD: Domain Knowledge-Enhanced Causal Discovery from Unstructured Data10 Jul 2026
- 2026Effect-Level Validation for Causal Discovery9 Feb 2026