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

S$Ω$I:基于分数的O-信息估计

S$Ω$I: Score-based O-INFORMATION Estimation

Ampere Software Technology(安培软件技术公司);Eurecom(欧洲通信大学)

Mustapha Bounoua, Giulio Franzese, Pietro Michiardi

AI总结:

本文提出S$Ω$I方法,首次在无限制性假设条件下估计O-information,以量化多变量系统中的高阶协同与冗余平衡,并通过合成数据和真实用例验证其有效性。

摘要:

科学数据和复杂多变量系统的分析需要能够捕捉多个随机变量之间关系的信息量。近年来,为了克服经典信息量(如仅限于考虑成对交互的互信息)的不足,人们提出了新的信息论度量。其中,信息协同与冗余的概念对于理解变量之间的高阶依赖关系至关重要。基于这一概念的最突出且通用的度量之一是O-information,它为量化多变量系统中的协同-冗余平衡提供了一种清晰且可扩展的方法。然而,其实际应用仅限于简化情形。在本工作中,我们提出S$Ω$I,首次允许在不对系统作限制性假设的情况下计算O-information。我们的实验在合成数据上验证了该方法,并展示了S$Ω$I在真实世界用例中的有效性。

英文摘要:

The analysis of scientific data and complex multivariate systems requires information quantities that capture relationships among multiple random variables. Recently, new information-theoretic measures have been developed to overcome the shortcomings of classical ones, such as mutual information, that are restricted to considering pairwise interactions. Among them, the concept of information synergy and redundancy is crucial for understanding the high-order dependencies between variables. One of the most prominent and versatile measures based on this concept is O-information, which provides a clear and scalable way to quantify the synergy-redundancy balance in multivariate systems. However, its practical application is limited to simplified cases. In this work, we introduce S$Ω$I, which allows for the first time to compute O-information without restrictive assumptions about the system. Our experiments validate our approach on synthetic data, and demonstrate the effectiveness of S$Ω$I in the context of a real-world use case.

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

↑