Emergent representations in networks trained with the Forward-Forward algorithm
Niccolò Tosato, Lorenzo Basile, Emanuele Ballarin, Giuseppe de Alteriis, Alberto Cazzaniga, Alessio Ansuini
TL;DR
Backpropagation has been criticised for its biological implausibility, motivating exploration of Forward-Forward (FF) as a more plausible alternative. This study analyzes the internal representations learned by FF across several datasets and compares FF with Backpropagation-on-the-same-goodness (BP/FF) and standard Backprop (BP). The key finding is that FF naturally yields sparse, category-specific ensembles—small groups of co-activating units—that can also arise for unseen categories and can be shared across visually related classes; interestingly, similar sparsity can emerge when training with Backprop on the same objective. The work highlights potential connections between lightweight, biologically inspired learning rules and efficient neural coding, with implications for zero-shot classification and model compression.
Abstract
The Backpropagation algorithm has often been criticised for its lack of biological realism. In an attempt to find a more biologically plausible alternative, the recently introduced Forward-Forward algorithm replaces the forward and backward passes of Backpropagation with two forward passes. In this work, we show that the internal representations obtained by the Forward-Forward algorithm can organise into category-specific ensembles exhibiting high sparsity -- composed of a low number of active units. This situation is reminiscent of what has been observed in cortical sensory areas, where neuronal ensembles are suggested to serve as the functional building blocks for perception and action. Interestingly, while this sparse pattern does not typically arise in models trained with standard Backpropagation, it can emerge in networks trained with Backpropagation on the same objective proposed for the Forward-Forward algorithm.
