mlsanityData to 7 Oct 2026

Bits and Pieces: Understanding Information Decomposition from Part-whole Relationships and Formal Logic

arXiv 2008.09535 ↗First posted 21 Aug 2020cs.AI cs.IT math.ITcited by 15

Not on the map. Why?

Abstract (arXiv)

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 distinct way in which the sources may contain information about the target. In this paper we show, first, that the entire theory of partial information decomposition can be derived from considerations of elementary parthood relationships between information contributions. This way of approaching the problem has the advantage of directly characterizing the atoms of information, instead of taking an indirect approach via the concept of redundancy. Secondly, we describe several intriguing links between PID and formal logic. In particular, we show how to define a measure of PID based on the information provided by certain statements about source realizations. Furthermore, we show how the mathematical lattice structure underlying PID theory can be translated into an isomorphic structure of logical statements with a particularly simple ordering relation: logical implication. The conclusion to be drawn from these considerations is that there are three isomorphic "worlds" of partial information decomposition, i.e. three equivalent ways to mathematically describe the decomposition of the information carried by a set of sources about a target: the world of parthood relationships, the world of logical statements, and the world of antichains that was utilized by Williams and Beer in their original exposition of PID theory. We additionally show how the parthood perspective provides a systematic way to answer a type of question that has been much discussed in the PID field: whether a partial information decomposition can be uniquely determined based on concepts other than redundant information.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 5; 2024: 2; 2025: 2; 2026: 1.

15 papers.

Sort:

By area:

  1. 2023To Compress or Not to Compress- Self-Supervised Learning and Information Theory: A Reviewcited by 72
  2. 2021A Rigorous Information-Theoretic Definition of Redundancy and Relevancy in Feature Selection Based on (Partial) Information Decompositioncited by 25
  3. 2023Learning from data with structured missingnesscited by 24
  4. 2023More Synergy, Less Redundancy: Exploiting Joint Mutual Information for Self-Supervised Learningcited by 11
  5. 2022A Measure of the Complexity of Neural Representations based on Partial Information Decompositioncited by 10
  6. 2023Information decomposition in complex systems via machine learningcited by 9
  7. 2023A General Framework for Interpretable Neural Learning based on Local Information-Theoretic Goal Functionscited by 8
  8. 2022Synergistic information supports modality integration and flexible learning in neural networks solving multiple taskscited by 7
  9. 2022Ultra-marginal Feature Importance: Learning from Data with Causal Guaranteescited by 6
  10. 2025Stochastic Forward-Forward Learning through Representational Dimensionality Compressioncited by 4
  11. 2026Auditing Language Model Unlearning via Information Decompositioncited by 3
  12. 2024What should a neuron aim for? Designing local objective functions based on information theorycited by 2
3 more
  1. 2021Interaction-Aware Sensitivity Analysis for Aerodynamic Optimization Results using Information Theorycited by 0
  2. 2024Rethinking Self-Supervised Learning Within the Framework of Partial Information Decompositioncited by 0
  3. 2025Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networkscited by 0