about
Stable, Fast, Automatic Learning Algorithm for Predictive Coding Networks [pdf] (arxiv.org)
3 points by kelseyfrog on Nov 29, 2024 | hide | past | pdf | discuss on HN

In plain words: Brain-inspired networks that learn by predicting their own inputs usually update weights in a slow, shaky way. Simply reordering when those updates happen makes training automatic and provably convergent, beating the original on image and language tasks in accuracy, speed, and tuning stability.

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

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.

Tommaso Salvatori, Yuhang Song, Yordan Yordanov, Beren Millidge, Zhenghua Xu, Lei Sha, Cornelius Emde, Rafal Bogacz, Thomas Lukasiewicz
arXiv:2212.00720 · cs.NE, cs.AI, cs.LG · submitted Nov 16, 2022 · updated Feb 7, 2024
abstract · pdf · html · Change of title and abstract, that now reflect the version accepted for publication. One co-author also added, that performed the additional experiments

add comment on HN