arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.05103cs.ITcs.CRmath.IT
收藏

独特的信息和防御

Unique Informations and Deficiencies

Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Johannes Rauh

摘要:

给定两个通道,传达关于同一随机变量的信息,我们引入两个措施的唯一信息的一个通道相对于其他。这两个量是基于广义加权Le Cam缺陷的概念,并且在一个通道是否可以通过在其输入或输出处的随机化来近似另一个通道上有所不同。我们建议的数量与现有的措施,我们称之为最小协同独特的信息。我们给后者的操作解释的上界的秘密密钥速率和讨论的作用的唯一信息的上下文中的非负互信息分解成唯一的,冗余的和协同的组件。

英文摘要:

Given two channels that convey information about the same random variable, we introduce two measures of the unique information of one channel with respect to the other. The two quantities are based on the notion of generalized weighted Le Cam deficiencies and differ on whether one channel can approximate the other by a randomization at either its input or output. We relate the proposed quantities to an existing measure of unique information which we call the minimum-synergy unique information. We give an operational interpretation of the latter in terms of an upper bound on the one-way secret key rate and discuss the role of the unique informations in the context of nonnegative mutual information decompositions into unique, redundant and synergistic components.

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

↑