Pith. sign in

REVIEW 2 cited by

Self-Contrastive Forward-Forward Algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.11593 v2 pith:7WOIRLGO submitted 2024-09-17 cs.LG cs.AIcs.CVcs.ETcs.NE

classification cs.LGcs.AIcs.CVcs.ETcs.NE
keywords learningalgorithmforward-forwardperformancetaskstrainingalgorithmsbenchmark
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Agents that operate autonomously benefit from lifelong learning capabilities. However, compatible training algorithms must comply with the decentralized nature of these systems, which imposes constraints on both the parameter counts and the computational resources. The Forward-Forward (FF) algorithm is one of these. FF relies only on feedforward operations, the same used for inference, for optimizing layer-wise objectives. This purely forward approach eliminates the need for transpose operations required in traditional backpropagation. Despite its potential, FF has failed to reach state-of-the-art performance on most standard benchmark tasks, in part due to unreliable negative data generation methods for unsupervised learning. In this work, we propose the Self-Contrastive Forward-Forward (SCFF) algorithm, a competitive training method aimed at closing this performance gap. Inspired by standard self-supervised contrastive learning for vision tasks, SCFF generates positive and negative inputs applicable across various datasets. The method demonstrates superior performance compared to existing unsupervised local learning algorithms on several benchmark datasets, including MNIST, CIFAR-10, STL-10, and Tiny ImageNet. We extend FF's application to training recurrent neural networks, expanding its utility to sequential data tasks. These findings pave the way for high-accuracy, real-time learning on resource-constrained edge devices.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Scalable Forward-Forward Algorithm

    cs.LG 2025-01 conditional novelty 5.0 of 10

    SFF trains convolutional networks layer-by-layer with auxiliary class-goodness layers and block-wise local backpropagation, reaching backprop-comparable accuracy on small benchmarks in the reported runs.

  2. On Advancements of the Forward-Forward Algorithm

    cs.LG 2025-04 conditional novelty 3.0 of 10

    Combining convolutional channel grouping, channel-wise loss, chunked local updates, and last-layer inference reduces CIFAR10 test error for Forward-Forward networks, with lightweight models reaching about 19-24% error.

Pith tools