Cited by 96Neural Networks and ApplicationsNeural dynamics and brain functionAdvanced Memory and Neural Computing

Predictive Coding Approximates Backprop Along Arbitrary Computation Graphs

Open access
Millidge, Beren, Tschantz, Alexander, Buckley, Christopher L.·2022·Neural Computation

Abstract

Backpropagation of error (backprop) is a powerful algorithm for training machine learning architectures through end-to-end differentiation. Recently it has been shown that backprop in multilayer perceptrons (MLPs) can be approximated using predictive coding, a biologically plausible process theory of cortical computation that relies solely on local and Hebbian updates. The power of backprop, however, lies not in its instantiation in MLPs but in the concept of automatic differentiation, which allows for the optimization of any differentiable program expressed as a computation graph. Here, we demonstrate that predictive coding converges asymptotically (and in practice, rapidly) to exact backprop gradients on arbitrary computation graphs using only local learning rules. We apply this result to develop a straightforward strategy to translate core machine learning architectures into their predictive coding equivalents. We construct predictive coding convolutional neural networks, recurrent neural networks, and the more complex long short-term memory, which include a nonlayer-like branching internal graph structure and multiplicative interactions. Our models perform equivalently to backprop on challenging machine learning benchmarks while using only local and (mostly) Hebbian plasticity. Our method raises the potential that standard machine learning algorithms could in principle be directly implemented in neural circuitry and may also contribute to the development of completely distributed neuromorphic architectures.

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_01497

Cites

108 of 108 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?

  • 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 Millidge et al., 2022

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

5 of the 113 references couldn’t be matched to a known paper.

Research works printed but not linked: 2

  1. Linnainmaa, S. (1970). The representation of the cumulative rounding error of an algorithm as a taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6-7.
  2. Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., & Sutskever, I. (2019). Language models are unsupervised multitask learners. OpenAI Blog, 1(8), 9.

Cited by

Sorted by citations

Authors
Millidge, B., Tschantz, A., & Buckley, C. L.
Affiliations
  • University of Edinburgh (GB)
  • University of Sussex (GB)
Corresponding author
  • Millidge, Beren
  • Tschantz, Alexander
  • Buckley, Christopher L.
Venue
Neural Computation
Publisher
MIT Press
Published
2022-05-19
Volume
34
Issue
6
Pages
1329-1368
ISSN
  • 0899-7667 (ISSN-L)
  • 1530-888X
OpenAlex
W3033108376
Cited by
95
References
113
Citations by year
2026: 11 · 2025: 15 · 2024: 11 · 2023: 16 · 2022: 19 · 2021: 19 · 2020: 4
FWCI
5.02
Type
journal article
Language
en
Open access
Locations
  • Neural Computation (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Figshare (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • University of Sussex
  • Engineering and Physical Sciences Research Council
  • Biotechnology and Biological Sciences Research Council (BB/P022197/1)
  • National Institutes of Natural Sciences (01112005)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Neural dynamics and brain function
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
Keywords
predictive coding, backpropagation, automatic differentiation, computational graphs, Hebbian learning, local learning rules, gradient approximation, convolutional neural networks, recurrent neural networks, long short-term memory, neuromorphic architectures, neural circuits
MeSH terms
Machine Learning, Algorithms, Neurons, Neural Networks, Computer

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