Statistical Inference for Causal Discovery under Selection and Latent Variables via Single-Target Interventions
AuthorsXiaotian Hou, Kwangmoon Park, Hongzhe Li
AffiliationsDepartment of Biostatistics, Epidemiology and Informatics · University of Pennsylvania
Resources
This work shows how a small, carefully designed set of single-variable interventions can recover causal structure even when hidden confounders and selection bias complicate the data.
Key results
The proposed procedure uses at most 2.5d_X^2 parallel statistical tests.
Any constraint-based algorithm requires at least 0.5d_X(d_X−1) queries in the worst case.
Simulation models contain d_X=20 observed system variables.
The A549 interferon-β dataset contains 27,555 cells.
The real-data analysis produced a graph with 246 edges.
What the paper found
This paper develops a model-free framework for causal discovery when observed data are distorted by latent confounding and selection bias, using soft single-target interventions. Its central construct, the system-induced subgraph, isolates causal relations among system variables while treating context variables as nuisance factors. The authors represent these relations with maximal ancestral graphs and prove that intervening on every observed system variable, K=d_X, is both sufficient and worst-case necessary for uniquely identifying the trimmed combined-MAG. A two-stage procedure first estimates intervention-induced anterior sets with conditional two-sample tests, then performs parallel conditional-independence and invariance tests for adjacency and orientation, providing asymptotic family-wise error control. It requires at most 2.5d_X^2 statistical tests, while any constraint-based method needs at least 0.5d_X(d_X−1), establishing optimality up to a constant. Simulations use d_X=20 variables and 500 samples per regime, including negative-binomial Perturb-seq-like data; misspecified methods such as F-FCI or procedures that ignore selection show substantially inflated false-discovery rates. In a Perturb-seq analysis of interferon-β-stimulated A549 lung cancer cells, the method reduced the system to 51 target genes from 27,555 cells, inferred 246 graph edges, identified 6 selection ancestors, and flagged 200 gene pairs with evidence of latent confounding. The framework supports downstream tests for selection and confounding without parametric structural-equation assumptions.
Original abstract
Causal discovery from observational and interventional data becomes challenging in the presence of latent confounding and selection bias, where causal structure is no longer adequately represented by directed acyclic graphs over observed variables. Existing model-free methods often rely on an exponential number of conditional independence tests and provide limited uncertainty quantification in high-dimensional settings. We develop a model-free and constraint-query optimal statistical inference framework for causal discovery under latent variables and selection using single-target interventions. We introduce the system-induced subgraph (SIS) to capture the causal relations among system variables while accounting for context variables. We establish its identifiability through maximal ancestral graphs (MAGs), and show that interventions on each observed system variable are sufficient for unique identification and necessary in the worst case. Building on these results, we develop a two-stage graph inference procedure with asymptotic family-wise error control under sufficient first-stage power. For $d_X$ observed system variables, the procedure requires at most $\frac{5}{2}d_X^2$ statistical tests, parallelizable within each stage, and achieves optimal constraint-query complexity up to a constant factor. The framework accommodates soft interventions and avoids parametric structural equation assumptions. We illustrate the methods through analysis of Perturb-seq data from interferon-$β$-stimulated A549 lung cancer cell lines.
Read the original paperMore in Graph Learning
Browse all 32 papers →CodeGraph: Open-Taxonomy Knowledge Graph for Source Code with Wikidata Grounding
Federico Pennino, Andrea Gurioli, Stefano Zacchiroli, Maurizio Gabbrielli, Paolo Ferragina
CodeGraph turns 167 million source files into a Wikidata-grounded knowledge graph of algorithms, paradigms, patterns, and software domains.
GraphWrit3R: End-to-End 3D Scene Graph Writing
Luka Milivojevic, Nikola Popovic, Sayan Deb Sarkar, Sebastian Koch, Iro Armeni, Luc Van Gool, Danda Pani Paudel
GraphWrit3R turns 3D spatial data into open-vocabulary scene graphs using multimodal encoders and an LLM, without requiring ground-truth object annotations at inference.
Efficient Swing Computation for Retrieval in Large-Scale Recommender Systems
Runhao Jiang, Renchi Yang
This paper makes massive-scale item recommendations much faster by approximating graph-based similarity scores without sacrificing retrieval quality.