Artificial Neuronal Ensembles with Learned Context Dependent Gating
Matthew J. Tilley, Michelle Miller, David Freedman
Abstract
Biological neural networks are capable of recruiting different sets of neurons to encode different memories. However, when training artificial neural networks on a set of tasks, typically, no mechanism is employed for selectively producing anything analogous to these neuronal ensembles. Further, artificial neural networks suffer from catastrophic forgetting, where the network's performance rapidly deteriorates as tasks are learned sequentially. By contrast, sequential learning is possible for a range of biological organisms. We introduce Learned Context Dependent Gating (LXDG), a method to flexibly allocate and recall artificial neuronal ensembles', using a particular network structure and a new set of regularization terms. Activities in the hidden layers of the network are modulated by gates, which are dynamically produced during training. The gates are outputs of networks themselves, trained with a sigmoid output activation. The regularization terms we have introduced correspond to properties exhibited by biological neuronal ensembles. The first term penalizes low gate sparsity, ensuring that only a specified fraction of the network is used. The second term ensures that previously learned gates are recalled when the network is presented with input from previously learned tasks. Finally, there is a regularization term responsible for ensuring that new tasks are encoded in gates that are as orthogonal as possible from previously used ones. We demonstrate the ability of this method to alleviate catastrophic forgetting on continual learning benchmarks. When the new regularization terms are included in the model along with Elastic Weight Consolidation (EWC) it achieves better performance on the benchmark permuted MNIST' than with EWC alone. The benchmark `rotated MNIST' demonstrates how similar tasks recruit similar neurons to the artificial neuronal ensemble.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Continual learning in recurrent neural networksBenjamin Ehret, Christian Henning, Maria R. Cervera, Alexander Meulemans et al.ICLR 2021 · 4,433 citations
- Natural continual learning: success is a journey, not (just) a destinationTa-Chu Kao, Kristopher T. Jensen, Gido van de Ven, Alberto Bernacchia et al.NeurIPS 2021 · 72 citations
- Disentangling and mitigating the impact of task similarity for continual learningNaoki HirataniNeurIPS 2024 · 21 citations
- Efficient Spiking Neural Networks with Sparse Selective Activation for Continual LearningJiangrong Shen, Wenyao Ni, Qi Xu, Huajin TangAAAI 2024 · 42 citations
- Conditional Channel Gated Networks for Task-Aware Continual LearningDavide Abati, Jakub M. Tomczak, Tijmen Blankevoort, Simone Calderara et al.CVPR 2020
