An official website of the United States government
This paper focuses on the computational complexity of computing empirical plug-in estimates for causal effect queries. Given a causal graph and observational data, any identifiable causal query can be estimated from an expression over the observed variables, called the estimand. The estimand can then be evaluated by plugging in probabilities computed empirically from data. In contrast to conventional wisdom which assumes that high dimensional probabilistic functions will lead to exponential evaluation time, we show that estimand evaluation can be done efficiently, potentially in time linear in the data size, depending on the estimand's hypergraph. In particular, we show that both the treewidth and hypertree width of the estimand's structure bound the evaluation complexity, analogous to their role in bounding the complexity of inference in probabilistic graphical models. In settings with high dimensional functions, the hypertree width often provides a more effective bound, since the empirical distributions are sparse.
more »
« less
Estimating Causal Effects from Learned Causal Networks
The standard approach to answering an identifiable causaleffect query (e.g., P(Y |do(X)) given a causal diagram and observational data is to first generate an estimand, or probabilistic expression over the observable variables, which is then evaluated using the observational data. In this paper, we propose an alternative paradigm for answering causal-effect queries over discrete observable variables. We propose to instead learn the causal Bayesian network and its confounding latent variables directly from the observational data. Then, efficient probabilistic graphical model (PGM) algorithms can be applied to the learned model to answer queries. Perhaps surprisingly, we show that this model completion learning approach can be more effective than estimand approaches, particularly for larger models in which the estimand expressions become computationally difficult. We illustrate our method’s potential using a benchmark collection of Bayesian networks and synthetically generated causal models
more »
« less
- PAR ID:
- 10559809
- Publisher / Repository:
- {IOS} Press
- Date Published:
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This paper investigates the statistical efficiency of algebraic expressions (“estimands”) used to answer causal queries. We first examine structural rules, developing a partial dominance relationship for front-door estimands that extends recent results on back-door estimands. In many models, however, structural rules alone may be insufficient to select an estimand. For such cases, we propose empirical techniques for estimating and comparing the variance of different estimands using both the graph and observational data: a bootstrap-based method, and a computationally simpler yet practically effective method for discrete models which estimates the Fisher information matrices. We illustrate both methods’ effectiveness on a variety of causal diagrams and estimand forms.more » « less
-
This paper investigates the statistical efficiency of algebraic expressions (“estimands”) used to answer causal queries. We first examine structural rules, developing a partial dominance relationship for front-door estimands that extends recent results on back-door estimands. In many models, however, structural rules alone may be insufficient to select an estimand. For such cases, we propose empirical techniques for estimating and comparing the variance of different estimands using both the graph and observational data: a bootstrap-based method, and a computationally simpler yet practically effective method for discrete models which estimates the Fisher information matrices. We illustrate both methods’ effectiveness on a variety of causal diagrams and estimand forms.more » « less
-
Model-completion methods learn a full causal generative model consistent with observational data and a given causal graph, and answer interventional queries via probabilistic inference. We empirically compare two approaches presented recently. One approach learns the model using EM, named EM for Causal Inference (EM4CI). The other approach uses neural networks for completion, yielding two neural causal model approaches, MLE–NCM and GAN–NCM. We evaluate these methods on synthetic discrete benchmarks spanning multiple graph families and scales. Results show that EM4CI seems superior on large graphs in terms of accuracy, while NCM-based methods can be competitive on small models but incur substantially higher computational cost.more » « less
-
Model-completion methods learn a full causal generative model consistent with observational data and a given causal graph, and answer interventional queries via probabilistic inference. We empirically compare two approaches presented recently. One approach learns the model using EM, named EM for Causal Inference (EM4CI). The other approach uses neural networks for completion, yielding two neural causal model approaches, MLE–NCM and GAN–NCM. We evaluate these methods on synthetic discrete benchmarks spanning multiple graph families and scales. Results show that EM4CI seems superior on large graphs in terms of accuracy, while NCM-based methods can be competitive on small models but incur substantially higher computational cost.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Conference Paper:
- The DOI is not currently available.
