Causal inference using the algorithmic Markov condition
arXiv:0804.3678
Abstract
Inferring the causal structure that links n observables is usually based upon detecting statistical dependences and choosing simple graphs that make the joint measure Markovian. Here we argue why causal inference is also possible when only single observations are present. We develop a theory how to generate causal graphs explaining similarities between single objects. To this end, we replace the notion of conditional stochastic independence in the causal Markov condition with the vanishing of conditional algorithmic mutual information and describe the corresponding causal inference rules. We explain why a consistent reformulation of causal inference in terms of algorithmic complexity implies a new inference principle that takes into account also the complexity of conditional probability densities, making it possible to select among Markov equivalent causal graphs. This insight provides a theoretical foundation of a heuristic principle proposed in earlier work. We also discuss how to replace Kolmogorov complexity with decidable complexity criteria. This can be seen as an algorithmic analog of replacing the empirically undecidable question of statistical independence with practical independence tests that are based on implicit or explicit assumptions on the underlying distribution.
16 figures
References in corpus (3)
Cited by in corpus (5)
- Telling cause from effect based on high-dimensional observations
- Causal Markov condition for submodular information measures
- On causally asymmetric versions of Occam's Razor and their relation to thermodynamics
- Distinguishing Cause and Effect via Second Order Exponential Models
- Justifying additive-noise-model based causal discovery via algorithmic information theory