arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.00709cs.ITmath.IT
收藏

基于公共信息的复杂系统信息分解新认识

Some new insights into information decomposition in complex systems based on common information

Pradeep Kr. Banerjee

摘要:

我们仔细研究了由一对预测随机变量$(X_1, X_2)$试图协同地、冗余地或唯一地编码目标随机变量$Y$引起的二元依赖性的结构。我们评估了最近提出的基于Gács-Körner共同信息的冗余度测量(Griffith等人,熵2014),并表明该措施,尽管它的优雅是退化的大多数非平凡的分布。我们表明,Wyner的共同信息也未能捕捉到冗余的概念,因为它违反了直观的单调非递增属性。我们确定了一组条件时,有条件的版本Gács和Körner的共同信息是一个理想的措施,独特的信息。最后,我们展示了如何近似充分统计和条件信息瓶颈的概念可以用来量化独特的信息。

英文摘要:

We take a closer look at the structure of bivariate dependency induced by a pair of predictor random variables $(X_1, X_2)$ trying to synergistically, redundantly or uniquely encode a target random variable $Y$. We evaluate a recently proposed measure of redundancy based on the Gács-Körner common information (Griffith et al., Entropy 2014) and show that the measure, in spite of its elegance is degenerate for most non-trivial distributions. We show that Wyner's common information also fails to capture the notion of redundancy as it violates an intuitive monotonically non-increasing property. We identify a set of conditions when a conditional version of Gács and Körner's common information is an ideal measure of unique information. Finally, we show how the notions of approximately sufficient statistics and conditional information bottleneck can be used to quantify unique information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑