Stability of Causal Inference
Abstract
?We consider the sensitivity of causal identification to small perturbations in the input. A long line of work culminating in papers by Shpitser and Pearl and Huang and Valtorta led to a complete procedure for the causal identification problem. In our main result in this paper, we show that the identification function computed by these procedures is in some cases extremely unstable numerically. Specifically, the "condition number" of causal identification can be of the order of ?(exp(n^0.49)) on an identifiable semi-Markovian model with n visible nodes. That is, in order to give an output accurate to d bits, the empirical probabilities of the observable events need to be obtained to accuracy d+?(n^0.49) bits.
Cite
Text
Schulman and Srivastava. "Stability of Causal Inference." Conference on Uncertainty in Artificial Intelligence, 2016.Markdown
[Schulman and Srivastava. "Stability of Causal Inference." Conference on Uncertainty in Artificial Intelligence, 2016.](https://mlanthology.org/uai/2016/schulman2016uai-stability/)BibTeX
@inproceedings{schulman2016uai-stability,
title = {{Stability of Causal Inference}},
author = {Schulman, Leonard J. and Srivastava, Piyush},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2016},
url = {https://mlanthology.org/uai/2016/schulman2016uai-stability/}
}