Selectivity and Shape in the Design of Forward-Forward Goodness Functions
Not on the map. Why?
Abstract (arXiv)
The Forward-Forward (FF) algorithm trains networks layer-by-layer using a local "goodness function," yet sum-of-squares (SoS) has remained the only choice studied. We systematically explore the goodness-function design space and identify a unifying principle: the goodness function must be sensitive to the shape of neural activity, not its total energy. This principle is motivated by the observation that deep network activations follow heavy-tailed distributions and that discriminative information is often concentrated in peak activities. We propose two complementary families: selective functions (top-k, entmax-weighted energy) that measure only peak activity, and shape-sensitive functions (excess kurtosis / "burstiness" and higher-order moments) that reward heavy-tailed distributions via scale-invariant statistics. Combined with separate label-feature forwarding (FFCL), controlled experiments across 13 goodness functions, 5 activations, 6 datasets, and three continuous sweeps, each tracing a characteristic inverted-U, yield 89.0% on Fashion-MNIST and 98.2+-0.1% on MNIST (4x2000), a +32.6pp gain over SoS, with consistent improvements across all benchmarks (+72pp USPS, +52pp SVHN). The scale-invariant nature of burstiness makes it particularly robust to magnitude shifts across layers and datasets.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 30 references that are in the map. First posted on arXiv 28 Mar 2026.
Builds on
13 of 30 references.
References · 13
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 341
- 2022The Forward-Forward Algorithm: Some Preliminary Investigationscited by 266
- 2016Equilibrium Propagation: Bridging the Gap Between Energy-Based Models and Backpropagationcited by 259
- 2019Sparse Sequence-to-Sequence Modelscited by 170
- 2019Adaptively Sparse Transformerscited by 155
- 2019Traditional and Heavy-Tailed Self Regularization in Neural Network Modelscited by 105
- 2019How Can We Be So Dense? The Benefits of Using Highly Sparse Representationscited by 45
- 2023The Predictive Forward-Forward Algorithmcited by 35
- 2023SymBa: Symmetric Backpropagation-Free Contrastive Learning with Forward-Forward Algorithm for Optimizing Convergencecited by 28
- 2023Layer Collaboration in the Forward-Forward Algorithmcited by 21
- 2024FFCL: Forward-Forward Net with Cortical Loops, Training and Inference on Edge Without Backpropagationcited by 6
Built on by
Not cited yet.