A General Framework for Interpretable Neural Learning based on Local Information-Theoretic Goal Functions
Not on the map. Why?
Abstract (arXiv)
Despite the impressive performance of biological and artificial networks, an intuitive understanding of how their local learning dynamics contribute to network-level task solutions remains a challenge to this date. Efforts to bring learning to a more local scale indeed lead to valuable insights, however, a general constructive approach to describe local learning goals that is both interpretable and adaptable across diverse tasks is still missing. We have previously formulated a local information processing goal that is highly adaptable and interpretable for a model neuron with compartmental structure. Building on recent advances in Partial Information Decomposition (PID), we here derive a corresponding parametric local learning rule, which allows us to introduce 'infomorphic' neural networks. We demonstrate the versatility of these networks to perform tasks from supervised, unsupervised and memory learning. By leveraging the interpretable nature of the PID framework, infomorphic networks represent a valuable tool to advance our understanding of the intricate structure of local learning.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 21 of its 89 references that are in the map. First posted on arXiv 3 Jun 2023.
Builds on
21 of 89 references.
References · 21
- 2022The Forward-Forward Algorithm: Some Preliminary Investigationscited by 262
- 2017Explainable Artificial Intelligence: Understanding, Visualizing and Interpreting Deep Learning Modelscited by 202
- 2014Difference Target Propagationcited by 144
- 2021Hyperparameter Optimization: Foundations, Algorithms, Best Practices and Open Challengescited by 143
- 2019Training Neural Networks with Local Error Signalscited by 135
- 2022Toward Transparent AI: A Survey on Interpreting the Inner Structures of Deep Neural Networkscited by 126
- 2018Dendritic cortical microcircuits approximate the backpropagation algorithmcited by 96
- 2020Predictive Coding Approximates Backprop along Arbitrary Computation Graphscited by 89
- 2019Putting An End to End-to-End: Gradient-Isolated Learning of Representationscited by 85
- 2020Direct Feedback Alignment Scales to Modern Deep Learning Tasks and Architecturescited by 56
- 2020Local plasticity rules can learn deep representations using self-supervised contrastive predictionscited by 47
- 2020Bits and Pieces: Understanding Information Decomposition from Part-whole Relationships and Formal Logiccited by 15
9 more
- 2016Measuring multivariate redundant information with pointwise common change in surprisalcited by 13
- 2015Partial Information Decomposition as a Unified Approach to the Specification of Neural Goal Functionscited by 12
- 2022Dendritic predictive coding: A theory of cortical computation with spiking neuronscited by 12
- 2023Dual Propagation: Accelerating Contrastive Hebbian Learning with Dyadic Neuronscited by 12
- 2022A Measure of the Complexity of Neural Representations based on Partial Information Decompositioncited by 10
- 2022Synergistic information supports modality integration and flexible learning in neural networks solving multiple taskscited by 7
- 2022Bio-Inspired, Task-Free Continual Learning through Activity Regularizationcited by 7
- 2023Forward-Forward Contrastive Learningcited by 5
- 2014Bits from Biology for Computational Intelligencecited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 3.
8 papers.
- 2026A Brain-like Synergistic Core in LLMs Drives Behaviour and Learningcited by 4
- 2024What should a neuron aim for? Designing local objective functions based on information theorycited by 2
- 2025An Energy-Based Mechanism for Compositional Behaviorcited by 2
- 2025Fully Geometric Multi-Hop Reasoning on Knowledge Graphs with Transitive Relationscited by 0
- 2025Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networkscited by 0
- 2025Information-theoretic signatures of causality in Bayesian networks and hypergraphscited by 0
- 2026Information Dynamics of Language Communicationcited by 0
- 2026Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraintscited by 0
- 2026Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints17 Jul 2026
- 2026Information Dynamics of Language Communication29 Jun 2026
- 2026A Brain-like Synergistic Core in LLMs Drives Behaviour and Learning11 Jan 2026
- 2025Information-theoretic signatures of causality in Bayesian networks and hypergraphs23 Dec 2025
- 2025An Energy-Based Mechanism for Compositional Behavior4 Dec 2025
- 2025Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks4 Nov 2025
- 2025Fully Geometric Multi-Hop Reasoning on Knowledge Graphs with Transitive Relations18 May 2025
- 2024What should a neuron aim for? Designing local objective functions based on information theory3 Dec 2024