Entropic Inequality Constraints from -separation Relations in Directed Acyclic Graphs with Hidden Variables
arXiv:2107.07087
Abstract
Directed acyclic graphs (DAGs) with hidden variables are often used to characterize causal relations between variables in a system. When some variables are unobserved, DAGs imply a notoriously complicated set of constraints on the distribution of observed variables. In this work, we present entropic inequality constraints that are implied by -separation relations in hidden variable DAGs with discrete observed variables. The constraints can intuitively be understood to follow from the fact that the capacity of variables along a causal pathway to convey information is restricted by their entropy; e.g. at the extreme case, a variable with entropy can convey no information. We show how these constraints can be used to learn about the true causal model from an observed data distribution. In addition, we propose a measure of causal influence called the minimal mediary entropy, and demonstrate that it can augment traditional measures such as the average causal effect.
arXiv comment18 pages. New in v3: Minor changes to the main text, substantial revisions to the proofs in Appendix C. We thank Robin Evans for motivating the most significant changes since v2
References in corpus (7)
- Causal structures from entropic information: Geometry and novel scenarios
- Nested Markov Properties for Acyclic Directed Mixed Graphs
- Quantifier Elimination for Statistical Problems
- Which causal structures might support a quantum-classical gap?
- Differentiable Causal Discovery Under Unmeasured Confounding
- A path-sampling method to partially identify causal effects in instrumental variable models
- Exclusivity graph approach to Instrumental inequalities