Finding Valid Adjustments under Non-ignorability with Minimal DAG Knowledge
Abhin Shah, Karthikeyan Shanmugam, Kartik Ahuja

TL;DR
This paper introduces a novel method for identifying valid adjustment sets in causal inference under non-ignorability, leveraging minimal DAG knowledge and invariance testing, with applications demonstrated on synthetic and real data.
Contribution
It establishes a new equivalence between invariance testing and valid adjustment identification under minimal structural knowledge, extending causal inference capabilities.
Findings
Effective in synthetic data experiments
Improves causal effect estimation on benchmarks
Connects adjustment finding to invariant risk minimization
Abstract
Treatment effect estimation from observational data is a fundamental problem in causal inference. There are two very different schools of thought that have tackled this problem. On one hand, Pearlian framework commonly assumes structural knowledge (provided by an expert) in form of directed acyclic graphs and provides graphical criteria such as back-door criterion to identify valid adjustment sets. On other hand, potential outcomes (PO) framework commonly assumes that all observed features satisfy ignorability (i.e., no hidden confounding), which in general is untestable. In prior works that attempted to bridge these frameworks, there is an observational criteria to identify an anchor variable and if a subset of covariates (not involving the anchor variable) passes a suitable conditional independence criteria, then that subset is a valid back-door. Our main result strengthens these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Causal Inference Techniques · Statistical Methods and Inference · Bayesian Modeling and Causal Inference
