A General Method for Deriving Tight Symbolic Bounds on Causal Effects

From MaRDI portal
Publication:6094085

DOI10.1080/10618600.2022.2071905arXiv2003.10702OpenAlexW4225275056MaRDI QIDQ6094085FDOQ6094085


Authors: Michael C. Sachs, A. Sjölander, Erin E. Gabriel Edit this on Wikidata


Publication date: 9 October 2023

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Abstract: A causal query will commonly not be identifiable from observed data, in which case no estimator of the query can be contrived without further assumptions or measured variables, regardless of the amount or precision of the measurements of observed variables. However, it may still be possible to derive symbolic bounds on the query in terms of the distribution of observed variables. Bounds, numeric or symbolic, can often be more valuable than a statistical estimator derived under implausible assumptions. Symbolic bounds, however, provide a measure of uncertainty and information loss due to the lack of an identifiable estimand even in the absence of data. We develop and describe a general approach for computation of symbolic bounds and characterize a class of settings in which our method is guaranteed to provide tight valid bounds. This expands the known settings in which tight causal bounds are solutions to linear programs. We also prove that our method can provide valid and possibly informative symbolic bounds that are not guaranteed to be tight in a larger class of problems. We illustrate the use and interpretation of our algorithms in three examples in which we derive novel symbolic bounds.


Full work available at URL: https://arxiv.org/abs/2003.10702




Recommendations




Cites Work


Cited In (1)





This page was built for publication: A General Method for Deriving Tight Symbolic Bounds on Causal Effects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094085)