Closed-form predictive coding via hierarchical Gaussian filters
Aleksandrs Baskakovs, Sylvain Estebe, Kenneth Enevoldsen, Kristoffer Nielbo, Chris Mathys, Nicolas Legrand

TL;DR
This paper introduces a novel closed-form predictive coding framework using hierarchical Gaussian filters that improves training speed, efficiency, and biological plausibility in deep neural networks.
Contribution
It reformulates predictive coding networks as deep hierarchical Gaussian filters, enabling fast, local, Bayesian inference with online learning of activations, weights, and precisions.
Findings
Approaches backpropagation in efficiency on FashionMNIST
Outperforms backpropagation on online and data efficiency tasks
Converges faster and handles concept drift effectively
Abstract
Predictive coding (PC) offers a local and biologically grounded alternative to backpropagation in the training of artificial neural networks, yet to date, it remains slower, and performance degrades sharply as network depth increases. We trace both problems to a single simplification: current PC networks fix the precision matrix to the identity, discarding precision-weighted prediction errors that the variational derivation requires to be fast, local, and Bayesian. We close this gap by expressing predictive coding networks as deep hierarchical Gaussian filters (HGFs) and restore precision-weighted message passing, yielding dynamic uncertainty estimates and Hebbian-compatible update rules at every layer. The resulting networks can simultaneously learn activations, weights, and precisions under a single free-energy objective, with no global error signal, and resolve inference without…
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.
