English
Related papers

Related papers: Nonnegative Decomposition of Multivariate Informat…

200 papers

We characterize information as risk reduction between knowledge states represented by partitions of the underlying probability space. Entropy corresponds to risk reduction from no (or partial) knowledge to full knowledge about a random…

Information Theory · Computer Science 2026-02-24 Sebastian Gottwald , Daniel A. Braun

What are the distinct ways in which a set of predictor variables can provide information about a target variable? When does a variable provide unique information, when do variables share redundant information, and when do variables combine…

Information Theory · Computer Science 2018-05-04 Conor Finn , Joseph T Lizier

We define a measure of redundant information based on projections in the space of probability distributions. Redundant information between random variables is information that is shared between those variables. But in contrast to mutual…

Information Theory · Computer Science 2013-05-30 Malte Harder , Christoph Salge , Daniel Polani

We consider the problem of decomposing the total mutual information conveyed by a pair of predictor random variables about a target random variable into redundant, unique and synergistic contributions. We focus on the relationship between…

Information Theory · Computer Science 2015-09-15 Pradeep Kr. Banerjee , Virgil Griffith

Williams and Beer (2010) proposed a nonnegative mutual information decomposition, based on the construction of redundancy lattices, which allows separating the information that a set of variables contains about a target variable into…

Data Analysis, Statistics and Probability · Physics 2018-04-05 Daniel Chicharro

Mutual information between two random variables is a well-studied notion, whose understanding is fairly complete. Mutual information between one random variable and a pair of other random variables, however, is a far more involved notion.…

Information Theory · Computer Science 2026-05-05 Aobo Lyu , Andrew Clark , Netanel Raviv

Williams and Beer (2010) proposed a nonnegative mutual information decomposition, based on the construction of information gain lattices, which allows separating the information that a set of variables contains about another into components…

Data Analysis, Statistics and Probability · Physics 2017-04-05 Daniel Chicharro , Stefano Panzeri

We present a theoretical framework that extends classical information theory to finite and structured systems by redefining redundancy as a fundamental property of information organization rather than inefficiency. In this framework,…

Machine Learning · Computer Science 2025-10-14 Yuda Bi , Ying Zhu , Vince D Calhoun

To fully characterize the information that two `source' variables carry about a third `target' variable, one must decompose the total information into redundant, unique and synergistic components, i.e. obtain a partial information…

Information Theory · Computer Science 2015-05-13 Adam B. Barrett

The formalism of partial information decomposition provides independent or non-overlapping components constituting total information content provided by a set of source variables about the target variable. These components are recognised as…

Molecular Networks · Quantitative Biology 2018-10-09 Ayan Biswas , Suman K Banik

In this paper, we define a new measure of the redundancy of information from a fault tolerance perspective. The partial information decomposition (PID) emerged last decade as a framework for decomposing the multi-source mutual information…

Information Theory · Computer Science 2024-04-03 Jesse Milzman

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…

Information Theory · Computer Science 2020-05-04 David Sigtermans

The problem of how to properly quantify redundant information is an open question that has been the subject of much recent research. Redundant information refers to information about a target variable S that is common to two or more…

Information Theory · Computer Science 2017-07-14 Robin A. A. Ince

The entropy of a pair of random variables is commonly depicted using a Venn diagram. This representation is potentially misleading, however, since the multivariate mutual information can be negative. This paper presents new measures of…

Information Theory · Computer Science 2020-04-22 Conor Finn , Joseph T. Lizier

In a system of three stochastic variables, the Partial Information Decomposition (PID) of Williams and Beer dissects the information that two variables (sources) carry about a third variable (target) into nonnegative information atoms that…

Information Theory · Computer Science 2017-08-30 Giuseppe Pica , Eugenio Piasini , Daniel Chicharro , Stefano Panzeri

Partial information decomposition (PID) seeks to decompose the multivariate mutual information that a set of source variables contains about a target variable into basic pieces, the so called "atoms of information". Each atom describes a…

Artificial Intelligence · Computer Science 2022-03-08 Aaron J. Gutknecht , Michael Wibral , Abdullah Makkeh

We offer a new approach to the information decomposition problem in information theory: given a 'target' random variable co-distributed with multiple 'source' variables, how can we decompose the mutual information into a sum of non-negative…

Information Theory · Computer Science 2019-10-15 Nihat Ay , Daniel Polani , Nathaniel Virgo

Information and uncertainty are closely related and extensively studied concepts in a number of scientific disciplines such as communication theory, probability theory, and statistics. Increasing the information arguably reduces the…

Probability · Mathematics 2011-08-09 Jiahua Chen

The partial information decomposition (PID) aims to quantify the amount of redundant information that a set of sources provides about a target. Here, we show that this goal can be formulated as a type of information bottleneck (IB) problem,…

Information Theory · Computer Science 2024-06-28 Artemy Kolchinsky

The conventional approach to the general Partial Information Decomposition (PID) problem has been redundancy-based: specifying a measure of redundant information between collections of source variables induces a PID via Moebius-Inversion…

Information Theory · Computer Science 2023-10-26 Aaron J. Gutknecht , Abdullah Makkeh , Michael Wibral
‹ Prev 1 2 3 10 Next ›