Growing Representation Learning
Not on the map. Why?
Abstract (arXiv)
Machine learning continues to grow in popularity due to its ability to learn increasingly complex tasks. However, for many supervised models, the shift in a data distribution or the appearance of a new event can result in a severe decrease in model performance. Retraining a model from scratch with updated data can be resource intensive or impossible depending on the constraints placed on an organization or system. Continual learning methods attempt to adapt models to new classes instead of retraining. However, many of these methods do not have a detection method for new classes or make assumptions about the distribution of classes. In this paper, we develop an attention based Gaussian Mixture, called GMAT, that learns interpretable representations of data with or without labels. We incorporate this method with existing Neural Architecture Search techniques to develop an algorithm for detection new events for an optimal number of representations through an iterative process of training a growing. We show that our method is capable learning new representations of data without labels or assumptions about the distributions of labels. We additionally develop a method that allows our model to utilize labels to more accurately develop representations. Lastly, we show that our method can avoid catastrophic forgetting by replaying samples from learned representations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 17 Oct 2021.
Builds on
13 of 20 references.
References · 13
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2016Progressive Neural Networkscited by 1,332
- 2017Continual Learning with Deep Generative Replaycited by 1,152
- 2019Three scenarios for continual learningcited by 610
- 2018Re-evaluating Continual Learning Scenarios: A Categorization and Case for Strong Baselinescited by 228
- 2016Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoderscited by 219
- 2019Continual Unsupervised Representation Learningcited by 147
- 2016Network Morphismcited by 63
- 2019Splitting Steepest Descent for Growing Neural Architecturescited by 52
- 2018Life-Long Disentangled Representation Learning with Cross-Domain Latent Homologiescited by 43
- 2019Energy-Aware Neural Architecture Optimization with Fast Splitting Steepest Descentcited by 17
1 more
Built on by
Not cited yet.