Table of Contents
Fetching ...

Testing Partially-Identifiable Causal Queries Using Ternary Tests

Sourbh Bhadane, Joris M. Mooij, Philip Boeken, Onno Zoeter

TL;DR

It is proved that obtaining ternary tests by combining binary tests is complete and it is demonstrated how topological conditions serve as a guide to construct ternary tests for two concrete causal hypothesis testing problems, namely testing the instrumental variable (IV) inequalities and comparing treatment efficacy.

Abstract

We consider hypothesis testing of binary causal queries using observational data. Since the mapping of causal models to the observational distribution that they induce is not one-to-one, in general, causal queries are often only partially identifiable. When binary statistical tests are used for testing partially-identifiable causal queries, their results do not translate in a straightforward manner to the causal hypothesis testing problem. We propose using ternary (three-outcome) statistical tests to test partially-identifiable causal queries. We establish testability requirements that ternary tests must satisfy in terms of uniform consistency and present equivalent topological conditions on the hypotheses. To leverage the existing toolbox of binary tests, we prove that obtaining ternary tests by combining binary tests is complete. Finally, we demonstrate how topological conditions serve as a guide to construct ternary tests for two concrete causal hypothesis testing problems, namely testing the instrumental variable (IV) inequalities and comparing treatment efficacy.

Testing Partially-Identifiable Causal Queries Using Ternary Tests

TL;DR

It is proved that obtaining ternary tests by combining binary tests is complete and it is demonstrated how topological conditions serve as a guide to construct ternary tests for two concrete causal hypothesis testing problems, namely testing the instrumental variable (IV) inequalities and comparing treatment efficacy.

Abstract

We consider hypothesis testing of binary causal queries using observational data. Since the mapping of causal models to the observational distribution that they induce is not one-to-one, in general, causal queries are often only partially identifiable. When binary statistical tests are used for testing partially-identifiable causal queries, their results do not translate in a straightforward manner to the causal hypothesis testing problem. We propose using ternary (three-outcome) statistical tests to test partially-identifiable causal queries. We establish testability requirements that ternary tests must satisfy in terms of uniform consistency and present equivalent topological conditions on the hypotheses. To leverage the existing toolbox of binary tests, we prove that obtaining ternary tests by combining binary tests is complete. Finally, we demonstrate how topological conditions serve as a guide to construct ternary tests for two concrete causal hypothesis testing problems, namely testing the instrumental variable (IV) inequalities and comparing treatment efficacy.
Paper Structure (19 sections, 14 theorems, 18 equations, 7 figures, 1 table, 2 algorithms)

This paper contains 19 sections, 14 theorems, 18 equations, 7 figures, 1 table, 2 algorithms.

Key Result

Proposition 1

The following are equivalent:

Figures (7)

  • Figure 1: SN test
  • Figure 2: SA test
  • Figure 3: Causal graph of $M \in \mathbb{M}_{\text{IV}}$
  • Figure 4: Causal graph of $M \in \mathbb{M}_{\text{IV,edge}}$
  • Figure 5: Average PCD of Algorithm \ref{['alg:tec']} plotted as a function of number of samples. The size for the constituent binary tests was fixed at $0.025$ each.
  • ...and 2 more figures

Theorems & Definitions (32)

  • Definition 1: Weak and Strong Consistency: Binary Tests
  • Proposition 1
  • Definition 2: Uniform Consistency: Binary Tests
  • Proposition 2
  • Proposition 2
  • Definition 3: Weak and Strong Consistency
  • Definition 4: $(i,j)$-error control
  • Definition 5: Ternary-Testable Hypotheses ($\text{TT}{\left({I}\right)}$)
  • Lemma 5
  • proof
  • ...and 22 more