A Theoretical Framework For Inference And Learning In Predictive Coding Networks
ASecurity**arXiv ID:** 2207.12316 **Authors:** Beren Millidge, Yuhang Song, Tommaso Salvatori, Thomas Lukasiewicz, Rafal Bogacz **Published:** 2022-07-21T04:17:55Z **Abstract:** Predictive coding (PC) is an influential theory in computational neuroscience, which argues that the cortex forms unsupervised world models by implementing a hierarchical process of prediction error minimization. PC networks (PCNs) are trained in two phases. First, neural activities are updated to optimize the network's respon...
- 3 stars
- 0 votes
- 0 copies
- 3 views
- Added September 11, 2026
Security analysis
100/100npx -y skills add hiyenwong/ai_collection --skill a-theoretical-framework-for-inference-and-learning-in-predictive-coding-networks --agent claude-codeAre you the author of A Theoretical Framework For Inference And Learning In Predictive Coding Networks?
Add the live security badge to your README. It updates with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-a-theoretical-framework-for-inference-and-learning)# A Theoretical Framework for Inference and Learning in Predictive Coding Networks
**arXiv ID:** 2207.12316
**Authors:** Beren Millidge, Yuhang Song, Tommaso Salvatori, Thomas Lukasiewicz, Rafal Bogacz
**Published:** 2022-07-21T04:17:55Z
**Abstract:**
Predictive coding (PC) is an influential theory in computational neuroscience, which argues that the cortex forms unsupervised world models by implementing a hierarchical process of prediction error minimization. PC networks (PCNs) are trained in two phases. First, neural activities are updated to optimize the network's response to external stimuli. Second, synaptic weights are updated to consolidate this change in activity -- an algorithm called \emph{prospective configuration}. While previous work has shown how in various limits, PCNs can be found to approximate backpropagation (BP), recent work has demonstrated that PCNs operating in this standard regime, which does not approximate BP, nevertheless obtain competitive training and generalization performance to BP-trained networks while outperforming them on tasks such as online, few-shot, and continual learning, where brains are known to excel. Despite this promising empirical performance, little is understood theoretically about the properties and dynamics of PCNs in this regime. In this paper, we provide a comprehensive theoretical analysis of the properties of PCNs trained with prospective configuration. We first derive analytical results concerning the inference equilibrium for PCNs and a previously unknown close connection relationship to target propagation (TP). Secondly, we provide a theoretical analysis of learning in PCNs as a variant of generalized expectation-maximization and use that to prove the convergence of PCNs to critical points of the BP loss function, thus showing that deep PCNs can, in theory, achieve the same generalization performance as BP, while maintaining their unique advantages.
## Skill Description
This skill is generated from the arXiv paper: A Theoretical Framework for Inference and Learning in Predictive Coding Networks (2207.12316).
## How to Use
[To be filled in by the user or by future automation]
## References
- [arXiv:2207.12316](http://arxiv.org/abs/2207.12316v2)
Attribution
Related skills
View all in tools →Comments
Loading comments…
Newsletter
Get the weekly list of safe new skills, and the ones we pulled.