Skip to yearly menu bar Skip to main content


A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks

Tommaso Salvatori · Yuhang Song · Yordan Yordanov · Beren Millidge · Lei Sha · Cornelius Emde · Zhenghua Xu · Rafal Bogacz · Thomas Lukasiewicz

Halle B #51
[ ]
Tue 7 May 1:45 a.m. PDT — 3:45 a.m. PDT


Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. Training such models, however, is quite inefficient and unstable. In this work, we show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one, and has theoretical guarantees in terms of convergence. The proposed algorithm, that we call incremental predictive coding (iPC) is also more biologically plausible than the original one, as it it fully automatic. In an extensive set of experiments, we show that iPC constantly performs better than the original formulation on a large number of benchmarks for image classification, as well as for the training of both conditional and masked language models, in terms of test accuracy, efficiency, and convergence with respect to a large set of hyperparameters.

Chat is not available.