Scalable Forward-Forward Algorithm

Andrii Krutsylo
1/6/2025
cs.LGcs.NE

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

We propose a scalable Forward-Forward (FF) algorithm that eliminates the need for backpropagation by training each layer separately. Unlike backpropagation, FF avoids backward gradients and can be more modular and memory efficient, making it appealing for large networks. We extend FF to modern convolutional architectures, such as MobileNetV3 and ResNet18, by introducing a new way to compute losses for convolutional layers. Experiments show that our method achieves performance comparable to standard backpropagation. Furthermore, when we divide the network into blocks, such as the residual blocks in ResNet, and apply backpropagation only within each block, but not across blocks, our hybrid design tends to outperform backpropagation baselines while maintaining a similar training speed. Finally, we present experiments on small datasets and transfer learning that confirm the adaptability of our method.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{krutsylo2025scalable,
  title  = {Scalable Forward-Forward Algorithm},
  author = {Andrii Krutsylo},
  year   = {2025},
  eprint = {2501.03176},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.03176v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.03176.svg)](https://codeofpaper.com/paper/2501.03176)

Discussion