Scalable Intervention Target Estimation in Linear Models
Burak Varici, Karthikeyan Shanmugam, Prasanna Sattigeri, Ali Tajer

TL;DR
This paper introduces a scalable algorithm for estimating intervention targets in linear causal models using differences in precision matrices, improving efficiency and accuracy over existing methods.
Contribution
It presents a novel, scalable method to identify intervention sites in linear SEMs by analyzing precision matrix differences, with proven consistency and improved sample complexity.
Findings
Algorithm accurately identifies intervention targets in simulations.
Method outperforms existing approaches in scalability and sample efficiency.
Code and implementation are publicly available for reproducibility.
Abstract
This paper considers the problem of estimating the unknown intervention targets in a causal directed acyclic graph from observational and interventional data. The focus is on soft interventions in linear structural equation models (SEMs). Current approaches to causal structure learning either work with known intervention targets or use hypothesis testing to discover the unknown intervention targets even for linear SEMs. This severely limits their scalability and sample complexity. This paper proposes a scalable and efficient algorithm that consistently identifies all intervention targets. The pivotal idea is to estimate the intervention sites from the difference between the precision matrices associated with the observational and interventional datasets. It involves repeatedly estimating such sites in different subsets of variables. The proposed algorithm can be used to also update a…
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
Taxonomy
TopicsBayesian Modeling and Causal Inference · Advanced Graph Neural Networks
