What's the right complexity measure for inferring causal relations?
- đ¤ Speaker: Dominik Janzing (Max Planck Institute Tuebingen)
- đ Date & Time: Friday 26 February 2010, 15:30 - 16:30
- đ Venue: MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
Abstract
If X causes Y for two random variables X and Y, we expect that the factorization of P(X,Y) into P(X)P(Y|X) is simpler than the non-causal factorization P(Y)P(X|Y). This is because P(Y|X) describes the causal mechanism while P(X|Y) is “only a mathematical expression”.
Discussions have shown that a lot of researchers agree on this intuition. Since we would like to use this principle for inferring causal directions, we are left with two problems:
(1) what does “simple” mean?
(2) is there any deeper justification for this principle?
Our answer to question (2) is a clear “yes” if complexity vs simplicity is measured in terms of Kolmogorov complexity: I will present a theory of causal inference that generalizes the framework of Bayesian networks to algorithmic instead of statistical conditional dependences. I will show that our theory implies the above inference principle. However, since Kolmogorov complexity is uncomputable we still need complexity measures that are appropriate for practical implementations.
I will present some first small steps towards this challenging goal.
Series This talk is part of the Statistics series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge Forum of Science and Humanities
- Cambridge Language Sciences
- Cambridge talks
- Chris Davis' list
- CMS Events
- custom
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Guy Emerson's list
- Hanchen DaDaDash
- Interested Talks
- Machine Learning
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
- rp587
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Statistics
- Statistics Group
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Dominik Janzing (Max Planck Institute Tuebingen)
Friday 26 February 2010, 15:30-16:30