On the Structure of Information
Sebastian Gottwald, Daniel A. Braun

TL;DR
This paper provides a unified, probability-theoretic framework for understanding and decomposing information into redundant, unique, and synergistic parts, preserving key properties like the chain rule and non-negativity.
Contribution
It introduces a general lattice-based approach to information decomposition grounded in probability theory, resolving foundational issues and clarifying the nature of information components.
Findings
Information as risk reduction between knowledge states
Decomposition into redundant, unique, and synergistic information
Preservation of fundamental properties like the chain rule
Abstract
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 variable, while information corresponds to risk reduction from no (or partial) knowledge to partial knowledge. This applies to any information measure that is based on expected loss minimization, such as Bregman information, with Shannon information and variance as prominent examples. In each case, fundamental properties like the chain rule, non-negativity, and the relationship between information and divergence are preserved. Because partitions form a lattice under refinement, our general treatment reveals how information can be decomposed into redundant, unique, and synergistic contributions, a question important in applications from neuroscience to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Cognitive Science and Education Research
