Testing Conditional Independence on Discrete Data using Stochastic Complexity

Marx, Alexander and Vreeken, Jilles
(2019) Testing Conditional Independence on Discrete Data using Stochastic Complexity.
In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS).
Conference: AISTATS International Conference on Artificial Intelligence and Statistics

This is the latest version of this item.

[img] Text
sci-marx,vreeken-wappendix.pdf

Download (716kB)

Abstract

Testing for conditional independence is a core aspect of constraint-based causal discovery. Although commonly used tests are perfect in theory, they often fail to reject independence in practice, especially when conditioning on multiple variables. We focus on discrete data and propose a new test based on the notion of algorithmic independence that we instantiate using stochastic complexity. Amongst others, we show that our proposed test, SCI, is an asymptotically unbiased as well as L2 consistent estimator for conditional mutual information (CMI). Further, we show that SCI can be reformulated to find a sensible threshold for CMI that works well on limited samples. Empirical evaluation shows that SCI has a lower type II error than commonly used tests. As a result, we obtain a higher recall when we use SCI in causal discovery algorithms, without compromising the precision.

Available Versions of this Item

  • Testing Conditional Independence on Discrete Data using Stochastic Complexity. (deposited 10 May 2021 11:29) [Currently Displayed]

Actions

Actions (login required)

View Item View Item