Cargando…

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

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

Descripción completa

Detalles Bibliográficos
Autores principales: Lässig, Francesco, Aceituno, Pau Vilimelis, Sorbaro, Martino, Grewe, Benjamin F.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Berlin Heidelberg 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10600047/
https://www.ncbi.nlm.nih.gov/pubmed/37589728
http://dx.doi.org/10.1007/s00422-023-00973-w
_version_ 1785125902518059008
author Lässig, Francesco
Aceituno, Pau Vilimelis
Sorbaro, Martino
Grewe, Benjamin F.
author_facet Lässig, Francesco
Aceituno, Pau Vilimelis
Sorbaro, Martino
Grewe, Benjamin F.
author_sort Lässig, Francesco
collection PubMed
description 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.
format Online
Article
Text
id pubmed-10600047
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher Springer Berlin Heidelberg
record_format MEDLINE/PubMed
spelling pubmed-106000472023-10-27 Bio-inspired, task-free continual learning through activity regularization Lässig, Francesco Aceituno, Pau Vilimelis Sorbaro, Martino Grewe, Benjamin F. Biol Cybern Original Article 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. Springer Berlin Heidelberg 2023-08-17 2023 /pmc/articles/PMC10600047/ /pubmed/37589728 http://dx.doi.org/10.1007/s00422-023-00973-w Text en © The Author(s) 2023 https://creativecommons.org/licenses/by/4.0/Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) .
spellingShingle Original Article
Lässig, Francesco
Aceituno, Pau Vilimelis
Sorbaro, Martino
Grewe, Benjamin F.
Bio-inspired, task-free continual learning through activity regularization
title Bio-inspired, task-free continual learning through activity regularization
title_full Bio-inspired, task-free continual learning through activity regularization
title_fullStr Bio-inspired, task-free continual learning through activity regularization
title_full_unstemmed Bio-inspired, task-free continual learning through activity regularization
title_short Bio-inspired, task-free continual learning through activity regularization
title_sort bio-inspired, task-free continual learning through activity regularization
topic Original Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10600047/
https://www.ncbi.nlm.nih.gov/pubmed/37589728
http://dx.doi.org/10.1007/s00422-023-00973-w
work_keys_str_mv AT lassigfrancesco bioinspiredtaskfreecontinuallearningthroughactivityregularization
AT aceitunopauvilimelis bioinspiredtaskfreecontinuallearningthroughactivityregularization
AT sorbaromartino bioinspiredtaskfreecontinuallearningthroughactivityregularization
AT grewebenjaminf bioinspiredtaskfreecontinuallearningthroughactivityregularization