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

计算唯一信息

Computing the Unique Information

Pradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar

摘要:

给定一对预测变量和一个响应变量,预测变量有多少关于响应的信息,这些信息如何分布在独特的、冗余的和协同的分量之间?最近的工作已经提出了量化的分解的唯一组件的最小值的条件互信息在一组约束的信息通道。我们提出了一个有效的迭代发散最小化算法来解决这个优化问题的收敛保证,并评估其性能对其他技术。

英文摘要:

Given a pair of predictor variables and a response variable, how much information do the predictors have about the response, and how is this information distributed between unique, redundant, and synergistic components? Recent work has proposed to quantify the unique component of the decomposition as the minimum value of the conditional mutual information over a constrained set of information channels. We present an efficient iterative divergence minimization algorithm to solve this optimization problem with convergence guarantees and evaluate its performance against other techniques.

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

↑