EWGN: Elastic Weight Generation and Context Switching in Deep Learning
Not on the map. Why?
Abstract (arXiv)
The ability to learn and retain a wide variety of tasks is a hallmark of human intelligence that has inspired research in artificial general intelligence. Continual learning approaches provide a significant step towards achieving this goal. It has been known that task variability and context switching are challenging for learning in neural networks. Catastrophic forgetting refers to the poor performance on retention of a previously learned task when a new task is being learned. Switching between different task contexts can be a useful approach to mitigate the same by preventing the interference between the varying task weights of the network. This paper introduces Elastic Weight Generative Networks (EWGN) as an idea for context switching between two different tasks. The proposed EWGN architecture uses an additional network that generates the weights of the primary network dynamically while consolidating the weights learned. The weight generation is input-dependent and thus enables context switching. Using standard computer vision datasets, namely MNIST and fashion-MNIST, we analyse the retention of previously learned task representations in Fully Connected Networks, Convolutional Neural Networks, and EWGN architectures with Stochastic Gradient Descent and Elastic Weight Consolidation learning algorithms. Understanding dynamic weight generation and context-switching ability can be useful in enabling continual learning for improved performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 26 references that are in the map. First posted on arXiv 1 Jun 2025.
Builds on
8 of 26 references.
References · 8
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2016Layer Normalizationcited by 5,669
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2021A Survey of Uncertainty in Deep Neural Networkscited by 680
Built on by
Not cited yet.