Pith. sign in

REVIEW 3 cited by

Activation Learning by Local Competitions

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 2209.13400 v2 pith:V4R7ZB3N submitted 2022-09-26 cs.NE cs.AIcs.CVcs.LG

classification cs.NEcs.AIcs.CVcs.LG
keywords learningactivationbackpropagationlocalnetworkcompetitionsdatasetsinvestigation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Despite its great success, backpropagation has certain limitations that necessitate the investigation of new learning methods. In this study, we present a biologically plausible local learning rule that improves upon Hebb's well-known proposal and discovers unsupervised features by local competitions among neurons. This simple learning rule enables the creation of a forward learning paradigm called activation learning, in which the output activation (sum of the squared output) of the neural network estimates the likelihood of the input patterns, or "learn more, activate more" in simpler terms. For classification on a few small classical datasets, activation learning performs comparably to backpropagation using a fully connected network, and outperforms backpropagation when there are fewer training samples or unpredictable disturbances. Additionally, the same trained network can be used for a variety of tasks, including image generation and completion. Activation learning also achieves state-of-the-art performance on several real-world datasets for anomaly detection. This new learning paradigm, which has the potential to unify supervised, unsupervised, and semi-supervised learning and is reasonably more resistant to adversarial attacks, deserves in-depth investigation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. What Does Goodness Measure? A Likelihood-Ratio Account of Forward-Forward Learning

    cs.LG 2026-07 conditional novelty 7.0 of 10

    Squared Forward-Forward goodness is the likelihood-ratio statistic for zero-mean populations differing in scale; anisotropic and heavy-tailed cases yield Mahalanobis and saturating (divisive-normalization) forms.

  2. Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints

    cs.LG 2026-07 conditional novelty 4.0 of 10

    A constrained Hebbian rule produces audiovisual representations with lower task-information cost (retained input information per unit of task-relevant information) than sparse backpropagation and DDTP at comparable ac...

  3. Energy-Efficient Information Representation in MNIST Classification Using Biologically Inspired Learning

    cs.LG 2026-02 conditional novelty 4.0 of 10

    On a 3-class MNIST subset, a competitive-Hebbian + weight-perturbation rule achieves higher estimated mutual information per nonsilent synapse than BP, but with much lower accuracy and no error bars.

Pith tools