Evidence map›Paper›PMID 40595637›Full record

ArticleNature communications2025

Self-Contrastive Forward-Forward algorithm.

Xing Chen, Dongshu Liu, Jérémie Laydevant, Julie Grollier

Abstract read
In one paragraph

Article in Nature communications, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Self-Contrastive Forward-Forward algorithm.Nature communications · 2025
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Xing ChenLaboratoire Albert Fert, CNRS, Thales, Université Paris-Saclay, Palaiseau, France. xing.chen@cnrs-thales.fr.ORCID http://orcid.org/0000-0002-9779-3857
Dongshu LiuLaboratoire Albert Fert, CNRS, Thales, Université Paris-Saclay, Palaiseau, France.
Jérémie LaydevantSchool of Applied and Engineering Physics, Cornell University, Ithaca, NY, USA.ORCID http://orcid.org/0009-0002-3544-6355
Julie GrollierLaboratoire Albert Fert, CNRS, Thales, Université Paris-Saclay, Palaiseau, France. julie.grollier@cnrs-thales.fr.ORCID http://orcid.org/0000-0003-4866-4490

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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 parameters 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 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.

Identifiers

PMID40595637
PMCPMC12217723

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.