Deriving Bounds and Inequality Constraints Using LogicalRelations Among Counterfactuals
Noam Finkelstein, Ilya Shpitser

TL;DR
This paper introduces a general method for deriving bounds and inequality constraints on causal parameters using logical relations among counterfactuals within causal graphical models, enhancing understanding of unobserved confounding.
Contribution
The paper presents a novel approach that leverages logical relations among counterfactuals to obtain bounds and inequalities, extending existing methods for causal inference under unobserved confounding.
Findings
Recovered known sharp bounds
Derived tight inequality constraints
Produced novel bounds and constraints
Abstract
Causal parameters may not be point identified in the presence of unobserved confounding. However, information about non-identified parameters, in the form of bounds, may still be recovered from the observed data in some cases. We develop a new general method for obtaining bounds on causal parameters using rules of probability and restrictions on counterfactuals implied by causal graphical models. We additionally provide inequality constraints on functionals of the observed data law implied by such causal models. Our approach is motivated by the observation that logical relations between identified and non-identified counterfactual events often yield information about non-identified events. We show that this approach is powerful enough to recover known sharp bounds and tight inequality constraints, and to derive novel bounds and constraints.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Logic, Reasoning, and Knowledge · Multi-Criteria Decision Making
MethodsCounterfactuals Explanations
