Testing Causal Models with Hidden Variables in Polynomial Delay via Conditional Independencies
Not on the map. Why?
Abstract (arXiv)
Testing a hypothesized causal model against observational data is a key prerequisite for many causal inference tasks. A natural approach is to test whether the conditional independence relations (CIs) assumed in the model hold in the data. While a model can assume exponentially many CIs (with respect to the number of variables), testing all of them is both impractical and unnecessary. Causal graphs, which encode these CIs in polynomial space, give rise to local Markov properties that enable model testing with a significantly smaller subset of CIs. Model testing based on local properties requires an algorithm to list the relevant CIs. However, existing algorithms for realistic settings with hidden variables and non-parametric distributions can take exponential time to produce even a single CI constraint. In this paper, we introduce the c-component local Markov property (C-LMP) for causal graphs with hidden variables. Since C-LMP can still invoke an exponential number of CIs, we develop a polynomial delay algorithm to list these CIs in poly-time intervals. To our knowledge, this is the first algorithm that enables poly-delay testing of CIs in causal graphs with hidden variables against arbitrary data distributions. Experiments on real-world and synthetic data demonstrate the practicality of our algorithm.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 69 references that are in the map. First posted on arXiv 22 Sep 2024.
Builds on
8 of 69 references.
References · 8
- 2021BCD Nets: Scalable Variational Approaches for Bayesian Causal Discoverycited by 68
- 2013Bayes-Ball: The Rational Pastime (for Determining Irrelevance and Requisite Information in Belief Networks and Influence Diagrams)cited by 18
- 2013An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanationcited by 17
- 2013Quantifier Elimination for Statistical Problemscited by 8
- 2014A factorization criterion for acyclic directed mixed graphscited by 8
- 2024A cautious approach to constraint-based causal model selectioncited by 6
- 2013Graphical Models and Exponential Familiescited by 2
- 2022Towards standard imsets for maximal ancestral graphscited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Less Greedy Equivalence Searchcited by 1
- 2025Less Greedy Equivalence Search27 Jun 2025