The reviewed record of science sign in
Pith

arxiv: 2509.08697 · v1 · pith:YFO472DF · submitted 2025-08-29 · cs.LG · cs.AI

Reshaping the Forward-Forward Algorithm with a Similarity-Based Objective

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YFO472DFrecord.jsonopen to challenge →

classification cs.LG cs.AI
keywords algorithmforward-forwardaccuracybackpropagationfaustforwardbackwardbiologically
0
0 comments X
read the original abstract

Backpropagation is the pivotal algorithm underpinning the success of artificial neural networks, yet it has critical limitations such as biologically implausible backward locking and global error propagation. To circumvent these constraints, the Forward-Forward algorithm was proposed as a more biologically plausible method that replaces the backward pass with an additional forward pass. Despite this advantage, the Forward-Forward algorithm significantly trails backpropagation in accuracy, and its optimal form exhibits low inference efficiency due to multiple forward passes required. In this work, the Forward-Forward algorithm is reshaped through its integration with similarity learning frameworks, eliminating the need for multiple forward passes during inference. This proposed algorithm is named Forward-Forward Algorithm Unified with Similarity-based Tuplet loss (FAUST). Empirical evaluations on MNIST, Fashion-MNIST, and CIFAR-10 datasets indicate that FAUST substantially improves accuracy, narrowing the gap with backpropagation. On CIFAR-10, FAUST achieves 56.22\% accuracy with a simple multi-layer perceptron architecture, approaching the backpropagation benchmark of 57.63\% accuracy.

This paper has not been read by Pith yet.

discussion (0)

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