基于因果张量的部分信息分解
A Partial Information Decomposition Based on Causal Tensors
摘要:
我们提出了一个部分信息分解的基础上新引入的框架因果张量,即,将源数据转换为目标数据的多线性随机映射。这个框架使我们能够用构成性的直接联想来表达间接联想。这在使用平均度量(如互信息或传递熵)时是不可能的。由此,产生了冗余和唯一信息的直观定义。所提出的冗余满足Williams和Beer提出的三个公理。对称性和自冗余性直接来自我们的定义。数据处理不等式确保满足单调性公理。另外,还满足了另外两个公理:恒等性和左单调性公理。由于因果张量可以将两个互信息都描述为传递熵,因此所提出的部分信息分解适用于这两种度量。结果表明,分解非常类似于另一种方法,表示协会的互信息的后验分解。它进一步表明,负的贡献可能会出现时,我们的假设完整的数据集,或什么应该包括作为一个源,是不正确的。
英文摘要:
We propose a partial information decomposition based on the newly introduced framework of causal tensors, i.e., multilinear stochastic maps that transform source data into destination data. This framework enables us to express an indirect association in terms of the constituting, direct associations. This is not possible when using average measures like mutual information or transfer entropy. From this, an intuitive definition of redundant and unique information arises. The proposed redundancy satisfies the three axioms stated by introduced by Williams and Beer. The symmetry and self-redundancy properties follow directly from our definition. The Data Processing Inequality ensures that the monotonicity axiom is satisfied. Additional, two other proposed axioms are satisfied: the identity property, and the left monotonicity axiom. Because causal tensors can describe both mutual information as transfer entropy, the proposed partial information decomposition applies to both measures. Results show that the decomposition closely resembles the decomposition of another approach that expresses associations in terms of mutual information a posteriori. It is furthermore demonstrated that negative contributions can arise when our assumptions about completeness of the data set, or what should be included as a source, are incorrect.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。