English
Related papers

Related papers: Synergy, Redundancy and Common Information

200 papers

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 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…

Information Theory · Computer Science 2015-03-03 Pradeep Kr. Banerjee

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

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…

Information Theory · Computer Science 2018-10-29 Pradeep Kr. Banerjee , Johannes Rauh , Guido Montúfar

Of the various attempts to generalize information theory to multiple variables, the most widely utilized, interaction information, suffers from the problem that it is sometimes negative. Here we reconsider from first principles the general…

Information Theory · Computer Science 2010-04-16 Paul L. Williams , Randall D. Beer

Quantifying cooperation or synergy among random variables in predicting a single target random variable is an important problem in many complex systems. We review three prior information-theoretic measures of synergy and introduce a novel…

Information Theory · Computer Science 2014-04-02 Virgil Griffith , Christof Koch

This paper considers the problem of defining a measure of redundant information that quantifies how much common information two or more random variables specify about a target random variable. We discussed desired properties of such a…

Information Theory · Computer Science 2023-07-19 Virgil Griffith , Tracey Ho

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 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

The interactions between three or more random variables are often nontrivial, poorly understood, and yet, are paramount for future advances in fields such as network information theory, neuroscience, genetics and many others. In this work,…

Information Theory · Computer Science 2016-04-20 Fernando Rosas , Vasilis Ntranos , Christopher J. Ellison , Sofie Pollin , Marian Verhelst

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 address three outstanding problems in information theory. Problem one is the definition of a non-negative decomposition of the information conveyed by two or more sources about a target variable into the specific contribution of each…

Information Theory · Computer Science 2022-06-28 Cesare Magri

This brief note considers the problem of estimating temporal synergy and integrated information in dyadic dynamical processes. One of the standard estimators of dynamic synergy is based on the minimal mutual information between sets of…

Information Theory · Computer Science 2024-07-24 Thomas F. Varley

Distributed computation in artificial life and complex systems is often described in terms of component operations on information: information storage, transfer and modification. Information modification remains poorly described however,…

Information Theory · Computer Science 2013-10-10 Joseph T. Lizier , Benjamin Flecker , Paul L. Williams

How can the information that a set ${X_{1},...,X_{n}}$ of random variables contains about another random variable $S$ be decomposed? To what extent do different subgroups provide the same, i.e. shared or redundant, information, carry unique…

Information Theory · Computer Science 2014-06-18 Nils Bertschinger , Johannes Rauh , Eckehard Olbrich , Jürgen Jost

Notwithstanding various attempts to construct a Partial Information Decomposition (PID) for multiple variables by defining synergistic, redundant, and unique information, there is no consensus on how one ought to precisely define either of…

Data Analysis, Statistics and Probability · Physics 2023-06-07 Steven J. van Enk

Measuring the relationship between any pair of variables is a rich and active area of research that is central to scientific practice. In contrast, characterizing the common information among any group of variables is typically a…

Machine Learning · Statistics 2017-06-20 Greg Ver Steeg , Shuyang Gao , Kyle Reing , Aram Galstyan

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

Obtaining meaningful quantitative descriptions of the statistical dependence within multivariate systems is a difficult open problem. Recently, the Partial Information Decomposition (PID) was proposed to decompose mutual information (MI)…

Information Theory · Computer Science 2017-02-21 Robin A. A. Ince

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
‹ Prev 1 2 3 10 Next ›