arXiv · 2611.17771
Interpretable confidence regions for causal discovery
Abstract
Most work in causal discovery focuses on point estimation of the underlying causal graph, while uncertainty in the learned structure has received substantially less attention. We develop confidence regions for the completed partially directed acyclic graph (CPDAG) identified from observational data. Our approach builds on perturbed PC (Chang et al., 2026), which generates plausible CPDAGs by perturbing the conditional independence tests underlying the widely used PC algorithm. The threshold used in these tests controls how perturbations translate into variation across the resulting CPDAGs. We propose a new thresholding strategy that suppresses spurious variation across runs while preserving asymptotic coverage, producing a substantially tighter collection of plausible CPDAGs. This collection is summarized through confidence balls and model confidence intervals constructed from the partially ordered set of CPDAGs under model inclusion. We also develop new theory and algorithms for the exact computation of these regions. Simulations show that our confidence regions attain good coverage while being substantially smaller and more interpretable than the original perturbed PC collections.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jian Kang, Arnav Mazumder, Giovanni Carter Lembo, Armeen Taeb. 2026-11-13. Interpretable confidence regions for causal discovery. https://searcharxiv.com/abs/2611.17771
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.