Pith. sign in

REVIEW 4 cited by

Equilibrium Propagation with Continual Weight Updates

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.04168 v1 pith:XMCVKJQ6 submitted 2020-04-29 cs.NE cs.LGstat.ML

Equilibrium Propagation with Continual Weight Updates

classification cs.NE cs.LGstat.ML
keywords learningphasesecondtimelocalneuronsbpttc-ep
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Equilibrium Propagation (EP) is a learning algorithm that bridges Machine Learning and Neuroscience, by computing gradients closely matching those of Backpropagation Through Time (BPTT), but with a learning rule local in space. Given an input $x$ and associated target $y$, EP proceeds in two phases: in the first phase neurons evolve freely towards a first steady state; in the second phase output neurons are nudged towards $y$ until they reach a second steady state. However, in existing implementations of EP, the learning rule is not local in time: the weight update is performed after the dynamics of the second phase have converged and requires information of the first phase that is no longer available physically. In this work, we propose a version of EP named Continual Equilibrium Propagation (C-EP) where neuron and synapse dynamics occur simultaneously throughout the second phase, so that the weight update becomes local in time. Such a learning rule local both in space and time opens the possibility of an extremely energy efficient hardware implementation of EP. We prove theoretically that, provided the learning rates are sufficiently small, at each time step of the second phase the dynamics of neurons and synapses follow the gradients of the loss given by BPTT (Theorem 1). We demonstrate training with C-EP on MNIST and generalize C-EP to neural networks where neurons are connected by asymmetric connections. We show through experiments that the more the network updates follows the gradients of BPTT, the best it performs in terms of training. These results bring EP a step closer to biology by better complying with hardware constraints while maintaining its intimate link with backpropagation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optical Implementation of Equilibrium Propagation Using Spatial Photonic Ising Machines

    physics.optics 2026-06 unverdicted novelty 6.0

    Hybrid optical implementation of equilibrium propagation via spatial photonic Ising machine demonstrated on Wine classification with numerical MNIST evaluation.

  2. Thermodynamic Networks: Harnessing Non-Equilibrium Steady States for Computation

    quant-ph 2026-05 unverdicted novelty 6.0

    Thermodynamic networks using non-equilibrium steady states achieve universal function approximation when engineered with negative differential conductance, as shown in quantum dot and enzymatic examples for sine fitti...

  3. Equilibrium Propagation for Non-Conservative Systems

    cs.LG 2026-02 conditional novelty 6.0

    A modified Equilibrium Propagation with an antisymmetric-Jacobian correction computes exact cost gradients for non-conservative neural dynamics.

  4. Scalable Equilibrium Propagation via Intermediate Error Signals for Deep Convolutional CRNNs

    cs.LG 2025-08 unverdicted novelty 6.0

    Introduces layer-wise learning signals combining knowledge distillation and local errors into Equilibrium Propagation, enabling scalable training of deep VGG-style CRNNs with SOTA results on CIFAR-10 and CIFAR-100.