Evidence map›Paper›PMID 37589728›Full record

ArticleBiological cybernetics2023

Bio-inspired, task-free continual learning through activity regularization.

Francesco Lässig, Pau Vilimelis Aceituno, Martino Sorbaro, Benjamin F Grewe

Abstract read
In one paragraph

Article in Biological cybernetics, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing 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

2 citing papers in PubMed.

  1. A general framework for interpretable neural learning based on local information-theoretic goal functions.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  2. 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.

Francesco LässigInstitute of Neuroinformatics University of Zürich and ETH, Zürich, Switzerland. flaessig@ethz.ch.ORCID 0000-0001-9535-9849
Pau Vilimelis AceitunoInstitute of Neuroinformatics University of Zürich and ETH, Zürich, Switzerland.ORCID 0000-0002-1218-4009
Martino SorbaroInstitute of Neuroinformatics University of Zürich and ETH, Zürich, Switzerland.ORCID 0000-0002-0182-7443
Benjamin F GreweInstitute of Neuroinformatics University of Zürich and ETH, Zürich, Switzerland.ORCID 0000-0001-8560-2120

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The ability to sequentially learn multiple tasks without forgetting is a key skill of biological brains, whereas it represents a major challenge to the field of deep learning. To avoid catastrophic forgetting, various continual learning (CL) approaches have been devised. However, these usually require discrete task boundaries. This requirement seems biologically implausible and often limits the application of CL methods in the real world where tasks are not always well defined. Here, we take inspiration from neuroscience, where sparse, non-overlapping neuronal representations have been suggested to prevent catastrophic forgetting. As in the brain, we argue that these sparse representations should be chosen on the basis of feed forward (stimulus-specific) as well as top-down (context-specific) information. To implement such selective sparsity, we use a bio-plausible form of hierarchical credit assignment known as Deep Feedback Control (DFC) and combine it with a winner-take-all sparsity mechanism. In addition to sparsity, we introduce lateral recurrent connections within each layer to further protect previously learned representations. We evaluate the new sparse-recurrent version of DFC on the split-MNIST computer vision benchmark and show that only the combination of sparsity and intra-layer recurrent connections improves CL performance with respect to standard backpropagation. Our method achieves similar performance to well-known CL methods, such as Elastic Weight Consolidation and Synaptic Intelligence, without requiring information about task boundaries. Overall, we showcase the idea of adopting computational principles from the brain to derive new, task-free learning algorithms for CL.

Indexed as

AlgorithmsNeural Networks, ComputerBrainFeedbackNeuronsActivity regularizationBio-inspiredContinual learningFeedbackLateral inhibitionSparsity

Identifiers

PMID37589728
PMCPMC10600047

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.