Efficient Identification of Direct Causal Parents via Invariance and Minimum Error Testing
Not on the map. Why?
Abstract (arXiv)
Invariant causal prediction (ICP) is a popular technique for finding causal parents (direct causes) of a target via exploiting distribution shifts and invariance testing (Peters et al., 2016). However, since ICP needs to run an exponential number of tests and fails to identify parents when distribution shifts only affect a few variables, applying ICP to practical large scale problems is challenging. We propose MMSE-ICP and fastICP, two approaches which employ an error inequality to address the identifiability problem of ICP. The inequality states that the minimum prediction error of the predictor using causal parents is the smallest among all predictors which do not use descendants. fastICP is an efficient approximation tailored for large problems as it exploits the inequality and a heuristic to run fewer tests. MMSE-ICP and fastICP not only outperform competitive baselines in many simulations but also achieve state-of-the-art result on a large scale real data benchmark.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 67 references that are in the map. First posted on arXiv 19 Sep 2024.
Builds on
27 of 67 references.
References · 27
- 2019Invariant Risk Minimizationcited by 1,832
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
- 2020The Risks of Invariant Risk Minimizationcited by 262
- 2013Causal Discovery with Continuous Additive Noise Modelscited by 252
- 2020Differentiable Causal Discovery from Interventional Datacited by 218
- 2021Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Gamecited by 159
- 2017Invariant Causal Prediction for Nonlinear Modelscited by 140
- 2017Domain Adaptation by Using Causal Inference to Predict Invariant Conditional Distributionscited by 125
- 2022Score matching enables causal discovery of nonlinear additive noise modelscited by 108
- 2022Deep End-to-end Causal Inferencecited by 93
- 2021Efficient Neural Causal Discovery without Acyclicity Constraintscited by 82
15 more
- 2017Permutation-based Causal Inference Algorithms with Interventionscited by 78
- 2019Permutation-Based Causal Structure Learning with Unknown Intervention Targetscited by 69
- 2020A causal framework for distribution generalizationcited by 68
- 2018Theoretical Impediments to Machine Learning With Seven Sparks from the Causal Revolutioncited by 66
- 2017Invariant Causal Prediction for Sequential Datacited by 63
- 2013Causal Discovery from Changescited by 52
- 2020Active Invariant Causal Prediction: Experiment Selection through Stabilitycited by 37
- 2013Jointly interventional and observational data: estimation of interventional Markov equivalence classes of directed acyclic graphscited by 25
- 2020Causal Feature Selection via Orthogonal Searchcited by 11
- 2021Towards Efficient Local Causal Structure Learningcited by 7
- 2021Variance Minimization in the Wasserstein Space for Invariant Causal Predictioncited by 5
- 2022Invariant Ancestry Searchcited by 5
- 2024Knockout: A simple way to handle missing inputscited by 4
- 2023Robust Learning via Conditional Prevalence Adjustmentcited by 2
- 2024Adapting to Shifting Correlations with Unlabeled Data Calibrationcited by 2
Built on by
Not cited yet.