A

$μ$PC: Scaling Predictive Coding to 100+ Layer Networks

arXiv (Cornell University)

Abstract

The biological implausibility of backpropagation (BP) has motivated many alternative, brain-inspired algorithms that attempt to rely only on local information, such as predictive coding (PC) and equilibrium propagation. However, these algorithms have notoriously struggled to train very deep networks, preventing them from competing with BP in large-scale settings. Indeed, scaling PC networks (PCNs) has recently been posed as a challenge for the community (Pinchetti et al., 2024). Here, we show that 100+ layer PCNs can be trained reliably using a Depth-$μ$P parameterisation (Yang et al., 2023; Bordelon et al., 2023) which we call "$μ$PC". By analysing the scaling behaviour of PCNs, we reveal several pathologies that make standard PCNs difficult to train at large depths. We then show that, despite addressing only some of these instabilities, $μ$PC allows stable training of very deep (up to 128-layer) residual networks on simple classification tasks with competitive performance and little tuning compared to current benchmarks. Moreover, $μ$PC enables zero-shot transfer of both weight and activity learning rates across widths and depths. Our results serve as a first step towards scaling PC to more complex architectures and have implications for other local algorithms. Code for $μ$PC is made available as part of a JAX library for PCNs.

Authors 3

  1. University of Sussex

    Affiliation as printed

    School of Engineering and Informatics University of Sussex

  2. RWTH Aachen University

    Affiliation as printed

    RWTH Aachen University Aachen , Germany

  3. Affiliation as printed

    School of Engineering and Informatics University of Sussex VERSES AI Research Lab Los Angeles , CA , USA

Cited by 0 stored of 0

No patents citing this paper on Lens.org (checked 2026-10-06).

References 0