The algorithmic independence of conditionals, which postulates that the causal mechanism is algorithmically independent of the cause, has recently inspired many highly successful approaches to distinguish cause from effect given only observational data. Most popular among these is the idea to approximate algorithmic independence via two-part Minimum Description Length (MDL). Although intuitively sensible, the link between the original postulate and practical two-part MDL encodings is left vague. In this work, we close this gap by deriving a two-part formulation of this postulate, in terms of Kolmogorov complexity, which directly links to practical MDL encodings. To close the cycle, we prove that this formulation leads on expectation to the same inference result as the original postulate.
翻译:有条件的算法独立性假设因果机制在逻辑上独立于原因之外,它最近激励了许多非常成功的方法,在只提供观察数据的情况下区分因果关系,其中最受欢迎的是通过两部分最低描述长度(MDL)来估计算法独立性的想法。虽然直觉上是明智的,但原始假设和实际的两部分MDL编码之间的联系却模糊不清。在这项工作中,我们缩小了这一差距,从Kolmogorov复杂程度的角度得出了这一假设的两部分提法,即与实际的MDL编码直接相连的Kolmogorov复杂程度。为了结束这一循环,我们证明这一提法引出了对最初假设的相同推论结果的期望。