CaSPECT: Discovering Causally Homogeneous Subgroups via Directed Spectral Clustering
Not on the map. Why?
Abstract (arXiv)
We propose CaSPECT, a causal spectral clustering framework for discovering causally homogeneous subgroups from observational data. Rather than clustering in covariate space, CaSPECT defines similarity through the topology of a learned directed acyclic graph (DAG); a bootstrap-stabilised PC algorithm recovers the causal skeleton; a novel Orientation Validation Score (OVS) combines PC bootstrap evidence with DirectLiNGAM to orient edges robustly; directed edges are weighted by backdoor-identified average treatment effects estimated via OLS or double machine learning. Chung's directed Laplacian provides a spectral embedding in which individuals close together share the same causal propagation pathways. We establish almost-sure consistency of the full pipeline and validate the method through a controlled simulation study and on LaLonde CPS1, IHDP, and 401(k) datasets, where CaSPECT recovers a positive and statistically significant treatment effect within the causally comparable subpopulation and corrects for severe confounding without requiring a pre-specified propensity score model.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 28 references that are in the map. First posted on arXiv 3 Jul 2026.
Builds on
5 of 28 references.
References · 5
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2017Causal Effect Inference with Deep Latent-Variable Modelscited by 408
- 2013Causal Inference and Causal Explanation with Background Knowledgecited by 168
- 2024Hierarchical and Density-based Causal Clusteringcited by 6
- 2024Causal K-Means Clusteringcited by 3
Built on by
Not cited yet.