SNAP: Sequential Non-Ancestor Pruning for Targeted Causal Effect Estimation With an Unknown Graph
Not on the map. Why?
Abstract (arXiv)
Causal discovery can be computationally demanding for large numbers of variables. If we only wish to estimate the causal effects on a small subset of target variables, we might not need to learn the causal graph for all variables, but only a small subgraph that includes the targets and their adjustment sets. In this paper, we focus on identifying causal effects between target variables in a computationally and statistically efficient way. This task combines causal discovery and effect estimation, aligning the discovery objective with the effects to be estimated. We show that definite non-ancestors of the targets are unnecessary to learn causal relations between the targets and to identify efficient adjustments sets. We sequentially identify and prune these definite non-ancestors with our Sequential Non-Ancestor Pruning (SNAP) framework, which can be used either as a preprocessing step to standard causal discovery methods, or as a standalone sound and complete causal discovery algorithm. Our results on synthetic and real data show that both approaches substantially reduce the number of independence tests and the computation time without compromising the quality of causal effect estimations.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 18 of its 61 references that are in the map. First posted on arXiv 11 Feb 2025.
Builds on
18 of 61 references.
References · 18
- 2013Learning Bayesian Networks: The Combination of Knowledge and Statistical Datacited by 187
- 2013Causal Inference and Causal Explanation with Background Knowledgecited by 170
- 2023Causal-learn: Causal Discovery in Pythoncited by 109
- 2020A Recursive Markov Boundary-Based Approach to Causal Structure Learningcited by 21
- 2024Adjustment Identification Distance: A gadjid for Causal Structure Learningcited by 16
- 2023Subset verification and search algorithms for causal DAGscited by 12
- 2024Recursive Causal Discoverycited by 12
- 2023Characterization and Learning of Causal Graphs with Small Conditioning Setscited by 11
- 2022Valid Inference After Causal Discoverycited by 10
- 2023Local Causal Discovery for Estimating Causal Effectscited by 10
- 2023Local Discovery by Partitioning: Polynomial-Time Causal Discovery Around Exposure-Outcome Pairscited by 9
- 2023Py-Tetrad and RPy-Tetrad: A New Python Interface with R Support for Tetrad Causal Searchcited by 8
6 more
- 2024Local Causal Discovery with Linear non-Gaussian Cyclic Modelscited by 7
- 2020Recovering Causal Structures from Low-Order Conditional Independenciescited by 6
- 2022Causal discovery under a confounder blanketcited by 6
- 2015Learning from Pairwise Marginal Independenciescited by 5
- 2022Variable elimination, graph reduction and efficient g-formulacited by 4
- 2023Meek Separators and Their Applications in Targeted Causal Discoverycited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.