Measuring Multivariate Redundant Information with Pointwise Common Change in Surprisal
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
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 predictor variables X i . It can be thought of as quantifying overlapping information content or similarities in the representation of S between the X i . We present a new measure of redundancy which measures the common change in surprisal shared between variables at the local or pointwise level. We provide a game-theoretic operational definition of unique information, and use this to derive constraints which are used to obtain a maximum entropy distribution. Redundancy is then calculated from this maximum entropy distribution by counting only those local co-information terms which admit an unambiguous interpretation as redundant information. We show how this redundancy measure can be used within the framework of the Partial Information Decomposition (PID) to give an intuitive decomposition of the multivariate mutual information into redundant, unique and synergistic contributions. We compare our new measure to existing approaches over a range of example systems, including continuous Gaussian variables. Matlab code for the measure is provided, including all considered examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Representational similarity analysis-connecting the branches of systems neuroscience
Kriegeskorte, N. (2008) · Frontiers in Systems Neuroscience · doi:10.3389/neuro.06.004.2008 · Cited by 3,355
Cited by
A Tutorial for Information Theory in Neuroscience
Timme, N. M., & Lapish, C. (2018) · eneuro · doi:10.1523/eneuro.0052-18.2018 · Cited by 242
“While the minimum information possesses distinct advantages over other methods, it has been shown that it measures the redundant amount of information as opposed to the redundant content, which several authors find counterintuitive (Harder et al., 2013; Bertschinger et al., 2014; Griffith et al., 2014; Ince, 2017).”
BackgroundMethodInfluentialInformation decomposition and the informational architecture of the brain
Luppi, A. I., Rosas, F. E., Mediano, P. A. M., Menon, D. K., & Stamatakis, E. A. (2024) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2023.11.005 · Cited by 140
Measuring integrated information: comparison of candidate measures in theory and simulation
Mediano, P., Seth, A., & Barrett, A. (2018) · Entropy · doi:10.3390/e21010017 · Cited by 145
“Note that alternatives are available for both discrete and linear-Gaussian systems [38, 23, 49, 13, 24].”
BackgroundMultivariate information theory uncovers synergistic subsystems of the human cerebral cortex
Varley, T. F., Pope, M., Faskowitz, J., & Sporns, O. (2023) · Communications Biology · doi:10.1038/s42003-023-04843-w · Cited by 101
Phillips, W. A., Bachmann, T., & Storm, J. F. (2018) · Frontiers in Neural Circuits · doi:10.3389/fncir.2018.00050 · Cited by 62
The partial information decomposition of generative neural network models
Tax, T., Mediano, P., & Shanahan, M. (2017) · Entropy · doi:10.3390/e19090474 · Cited by 55
Causal composition: Structural differences among dynamically equivalent systems
Albantakis, L., & Tononi, G. (2019) · Entropy · doi:10.3390/e21100989 · Cited by 30
Continuity and additivity properties of information decompositions
Rauh, J., Banerjee, P. K., Olbrich, E., Montúfar, G., & Jost, J. (2023) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2023.108979 · Cited by 7
Partial information decomposition for discrete target and continuous source random variables
Barà, C., Antonacci, Y., Iovino, M., Lazic, I., & Faes, L. (2025) · Physical Review E · doi:10.1103/58bg-5n9s · Cited by 6
Metadata
- Authors
- Ince, R.
- Venue
- Entropy
- Publisher
- MDPI AG
- Published
- 2017-06-29
- Volume
- 19
- Issue
- 7
- Pages
- 318
- ISSN
- 1099-4300 (ISSN-L)
- OpenAlex
- W2286271878
- Cited by
- 146
- References
- 2
- FWCI
- 8.86
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.