Cited by 278Neural Networks and ApplicationsNeural dynamics and brain functionMemory and Neural Mechanisms

An Approximation of the Error Backpropagation Algorithm in a Predictive Coding Network with Local Hebbian Synaptic Plasticity

Open access
Whittington, James C. R., Bogacz, Rafal·2017·Neural Computation

Abstract

To efficiently learn from feedback, cortical networks need to update synaptic weights on multiple levels of cortical hierarchy. An effective and well-known algorithm for computing such changes in synaptic weights is the error backpropagation algorithm. However, in this algorithm, the change in synaptic weights is a complex function of weights and activities of neurons not directly connected with the synapse being modified, whereas the changes in biological synapses are determined only by the activity of presynaptic and postsynaptic neurons. Several models have been proposed that approximate the backpropagation algorithm with local synaptic plasticity, but these models require complex external control over the network or relatively complex plasticity rules. Here we show that a network developed in the predictive coding framework can efficiently perform supervised learning fully autonomously, employing only simple local Hebbian plasticity. Furthermore, for certain parameters, the weight change in the predictive coding model converges to that of the backpropagation algorithm. This suggests that it is possible for cortical networks with simple Hebbian synaptic plasticity to implement efficient learning algorithms in which synapses in areas on multiple levels of hierarchy are modified to minimize the error on the output.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1162/neco_a_00949

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The large majority of predictive coding networks developed for machine-learning tasks fix precisions to the identity throughout training, effectively assuming homoscedastic noise and reducing the free energy to a sum of unweighted squared errors.

    “The large majority of PCNs developed for machine-learning tasks [Whittington and Bogacz, 2017, Salvatori et al., 2021, 2024, Millidge et al., 2022, Pinchetti et al., 2025, Oliviers et al., 2025, Song et al., 2024] fix precisions to the identity throughout training, effectively assuming homoscedastic noise and reducing the free energy to a sum of unweighted squared errors.”

    From Closed-form predictive coding via hierarchical Gaussian filters (2026) · cites this paper as Whittington and Bogacz, 2017

    Split into 2 atoms — 0 confirmed, 2 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.

    Experimental — accuracy not yet measured
  • Deep predictive coding implementations almost universally fix the precision matrix to the identity and infer activations by iterative gradient descent.

    “deep PC implementations almost universally fix the precision matrix to the identity and infer activations by iterative gradient descent.”

    From Closed-form predictive coding via hierarchical Gaussian filters (2026) · cites this paper as Whittington and Bogacz, 2017

    In Models > Predictive Coding for Supervised Learning (page unavailable), the paper describes inferring node values by repeatedly changing them along the gradient of a log-probability objective—equivalent to gradient descent on its negative. In Results > Relationship between the Models (page unavailable), it considers setting all variance parameters to 1. It does not establish that deep predictive coding implementations almost universally use an identity precision matrix; its own simulations also use a variance parameter of 100. (LLM, conf=0.87)

    Experimental — accuracy not yet measured
  • In iterative inference learning, posterior means are obtained by gradient descent run for T approximately 32-128 steps until equilibrium.

    “In iterative inference learning, posterior means are obtained by gradient descent μℓ = -∂F/∂µ ℓ run for T ≈ 32-128 steps until equilibrium [Song et al., 2024, Whittington and Bogacz, 2017, Salvatori et al., 2024, Innocenti et al., 2024].”

    From Closed-form predictive coding via hierarchical Gaussian filters (2026) · cites this paper as Whittington and Bogacz, 2017

    The Inference subsection (page unavailable) describes updating the first moments of approximate distributions along the objective-function gradient, and the model description says updates continue until a steady state. It does not support the stated 32–128 steps: Results > Performance on More Complex Learning Tasks (page unavailable) says the simulations used 20 steps per inference stage and that more steps would have allowed convergence. The paper formulates its update as maximizing a log-probability objective, rather than using the quoted negative-gradient notation. (LLM, conf=0.90)

    Experimental — accuracy not yet measured
  • Under appropriate conditions, predictive coding recovers the gradients computed by backpropagation through purely local message passing.

    “Under appropriate conditions, PC recovers the gradients computed by BP through purely local message passing [Whittington and Bogacz, 2017, Millidge et al., 2022, Song et al., 2024], making it a leading candidate for the next generation of energy-efficient, brain-inspired algorithms.”

    From Closed-form predictive coding via hierarchical Gaussian filters (2026) · cites this paper as Whittington and Bogacz, 2017

  • Eq. (3) is the standard Hebbian rule used in predictive coding networks with fixed identity precision.

    “Eq. ( 3) is the standard rule used in predictive coding networks with fixed identity precision [Whittington andBogacz, 2017, Song et al., 2024].”

    From Closed-form predictive coding via hierarchical Gaussian filters (2026) · cites this paper as Whittington and Bogacz, 2017

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 36

  1. Balduzzi D Vanchinathan H Buhmann J Kickback cuts backprop’s red-tape: Biologically plausible credit assignment in neural networks arXiv:1411.6191v1 2014 · arXiv
  2. Barto A Jordan M Gradient following without back-propagation in layered networks Proceedings of the 1st Annual International Conference on Neural Networks 1987 2 629 636 Piscataway, NJ
  3. Bell AH Summerfield C Morin EL Malecek NJ Ungerleider LG Encoding of stimulus probability in macaque inferior temporal cortex Current Biology 2016 26 17 2280 27524483 PMC5021632
  4. Bengio Y How auto-encoders could provide credit assignment in deep networks via target propagation arXiv:1407.7906 2014 · arXiv
  5. Bengio Y Fischer A Early inference in energy-based models approximates back-propagation arXiv:1510.02777 2015 · arXiv
  6. Bengio Y Lee D-H Bornschein J Lin Z Towards biologically plausible deep learning arXiv:1502.04156 2015 · arXiv
  7. Bogacz R A tutorial on the free-energy framework for modelling perception and learning Journal of Mathematical Psychology 2017 76 198 211 28298703 PMC5341759
  8. Bogacz R Markowska-Kaczmar U Kozik A Blinking artefact recognition in EEG signal using artificial neural network Proceedings of 4th Conference on Neural Networks and Their Applications 1999 502 507 Politechnika Czestochowska
  9. Bogacz R Moraud EM Abdi A Magill PJ Baufreton J Properties of neurons in external globus pallidus can support optimal action selection PLoS Comput Biol 2016 12 7 e1005004 27389780 PMC4936724
  10. Brown MW Aggleton JP Recognition memory: What are the roles of the perirhinal cortex and hippocampus? Nature Reviews Neuroscience 2001 2 1 51 61 11253359
  11. Crick F The recent excitement about neural networks Nature 1989 337 129 132 2911347
  12. Dayan P Hinton GE Neal RM Zemel RS The Helmholtz machine Neural Computation 1995 7 5 889 904 7584891
  13. Feldman H Friston K Attention, uncertainty, and free-energy Frontiers in Human Neuroscience 2010 4 215 21160551 PMC3001758
  14. Fiser A Mahringer D Oyibo HK Petersen AV Leinweber M Keller GB Experience-dependent spatial expectations in mouse visual cortex Nature Neuroscience 2016 19 1658 1664 27618309
  15. Friston K Learning and inference in the brain Neural Networks 2003 16 1325 1352 14622888
  16. Friston K A theory of cortical responses Philosophical Transactions of the Royal Society B 2005 360 815 836 PMC1569488 15937014
  17. Hinton GE McClelland JL Learning representations by recirculation Anderson DZ Neural information processing systems 1988 358 366 New York American Institute of Physics
  18. Hinton GE Osindero S Teh Y-W A fast learning algorithm for deep belief nets Neural Computation 2006 18 7 1527 1554 16764513
  19. Hyvarinen A Regression using independent component analysis, and its connection to multi-layer perceptrons Proceedings of the 9th International Conference on Artificial Neural Networks 1999 491 496 Stevenage, UK IEE
  20. Kingma D Ba J Adam: A method for stochastic optimization arXiv:1412.6980 2014 · arXiv
  21. Larochelle H Bengio Y Towards biologically plausible deep learning Proceedings of the 25th International Conference on Machine Learning 2008 536 543 New York ACM
  22. Lillicrap TP Cownden D Tweed DB Akerman CJ Random synaptic feedback weights support error backpropagation for deep learning Nature Communications 2016 7 13276 PMC5105169 27824044
  23. Mazzoni P Andersen RA Jordan MI A more biologically plausibile learning rule for neural networks Proc Natl Acad Sci USA 1991 88 4433 4437 1903542 PMC51674
  24. Miller LL Desimone R The representation of stimulus familiarity in anterior inferior temporal cortex Journal of Neurophysiology 1993 69 6 1918 1929 8350131
  25. Mizuseki K Buzsáki G Preconfigured, skewed distribution of firing rates in the hippocampus and entorhinal cortex Cell Reports 2013 4 5 1010 1021 23994479 PMC3804159
  26. O’Reilly RC Munakata Y Computational explorations in cognitive neuroscience 2000 Cambridge, MA MIT Press
  27. Plaut DC McClelland JL Seidenberg MS Patterson K Understanding normal and impaired word reading: Computational principles in quasi-regular domains Psychological Review 1996 103 56 115 8650300
  28. Scellier B Bengio Y Towards a biologically plausible backprop arXiv:1602.05179 2016 · arXiv
  29. Seidenberg MS McClelland JL A distributed, developmental model of word recognition and naming Psychological Review 1989 96 523 568 2798649
  30. Seung HS Learning in spiking neural networks by reinforcement of stochastic synaptic transmission Neuron 2003 40 1063 1073 14687542
  31. Spratling MW Reconciling predictive coding and biased competition models of cortical function Frontiers in Computational Neuroscience 2008 2 4 18978957 PMC2576514
  32. Srivastava N Salakhutdinov R Multimodal learning with deep boltzmann machines Pereira F Burges CJC Bottou L Weinberger KQ Advances in neural information processing systems 2012 25 2222 2230 Red Hook, NY Curran
  33. Summerfield C Egner T Greene M Koechlin E Mangels J Hirsch J Predictive codes for forthcoming perception in the frontal cortex Science 2006 314 1311 1314 17124325
  34. Werfel J Xiew X Seung HS Learning curves for stochastic gradient descent in linear feedforward networks Neural Computation 2005 17 2699 2718 16212768
  35. Whittington JC Bogacz R Learning in cortical networks through error back-propagation bioRxiv 2015 035451
  36. Zmarz P Keller GB Mismatch receptive fields in mouse visual cortex Neuron 2016 92 4 766 772 27974161

Cited by

Sorted by citations

Authors
Whittington, J. C. R., & Bogacz, R.
Affiliations
  • John Radcliffe Hospital (GB)
  • MRC Brain Network Dynamics Unit, University of Oxford, Oxford OX1 3TH, U.K., and Nuffield Department of Clinical Neurosciences, University of Oxford, John Radcliffe Hospital, Oxford OX3 9DU, U.K. rafal.bogacz@ndcn.ox.ac.uk
Corresponding author
Whittington, James C. R.
Venue
Neural Computation
Publisher
MIT Press
Published
2017-05-01
Volume
29
Issue
5
Pages
1229-1262
ISSN
  • 0899-7667 (ISSN-L)
  • 1530-888X
OpenAlex
W2604086949
Cited by
278
References
10
Citations by year
2026: 30 · 2025: 36 · 2024: 41 · 2023: 35 · 2022: 31 · 2021: 41 · 2020: 28 · 2019: 15 · 2018: 15 · 2017: 6
FWCI
10.44
Type
journal article
Language
en
Open access
Locations
  • Neural Computation (publishedVersion, cc-by-nc)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • Europe PMC (PubMed Central) (acceptedVersion, cc-by)
  • PubMed Central (acceptedVersion, cc-by)
Funders
  • Medical Research Council (MC_UU_12024/5)
  • Engineering and Physical Sciences Research Council
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Neural dynamics and brain function
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Memory and Neural Mechanisms
Keywords
backpropagation, predictive coding, Hebbian synaptic plasticity, cortical hierarchy, synaptic weight update
MeSH terms
Algorithms, Cerebral Cortex, Humans, Learning, Models, Neurological, Neuronal Plasticity, Neurons, Neural Networks, Computer, Feedback, Physiological

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review