Equilibrium Propagation Without Limits
Elon Litman
TL;DR
The paper removes the infinitesimal-nudge limitation in Equilibrium Propagation by modeling network states with Gibbs–Boltzmann distributions and defining a stochastic contrastive objective $J(\theta)$. It derives two exact gradient representations: the difference of expected local energy derivatives and a path-integral covariance form, establishing that finite nudging yields exact gradient descent on $J(\theta)$. A Gibbs variational and information-theoretic interpretation shows $J$ is a tight proxy for the supervised loss with KL regularization, connecting to variational inference and the information bottleneck. Empirical results on Fashion–MNIST demonstrate that finite-nudge EP can match backpropagation performance, overcoming the shortcomings of infinitesimal nudges and offering a local, biologically plausible learning mechanism grounded in statistical physics.
Abstract
We liberate Equilibrium Propagation (EP) from the limit of infinitesimal perturbations by establishing a finite-nudge foundation for local credit assignment. By modeling network states as Gibbs-Boltzmann distributions rather than deterministic points, we prove that the gradient of the difference in Helmholtz free energy between a nudged and free phase is exactly the difference in expected local energy derivatives. This validates the classic Contrastive Hebbian Learning update as an exact gradient estimator for arbitrary finite nudging, requiring neither infinitesimal approximations nor convexity. Furthermore, we derive a generalized EP algorithm based on the path integral of loss-energy covariances, enabling learning with strong error signals that standard infinitesimal approximations cannot support.
