mlsanityData to 7 Oct 2026

ImpressLearn: Continual Learning via Combined Task Impressions

arXiv 2210.01987 ↗First posted 5 Oct 2022cs.CV cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This work proposes a new method to sequentially train deep neural networks on multiple tasks without suffering catastrophic forgetting, while endowing it with the capability to quickly adapt to unseen tasks. Starting from existing work on network masking (Wortsman et al., 2020), we show that simply learning a linear combination of a small number of task-specific supermasks (impressions) on a randomly initialized backbone network is sufficient to both retain accuracy on previously learned tasks, as well as achieve high accuracy on unseen tasks. In contrast to previous methods, we do not require to generate dedicated masks or contexts for each new task, instead leveraging transfer learning to keep per-task parameter overhead small. Our work illustrates the power of linearly combining individual impressions, each of which fares poorly in isolation, to achieve performance comparable to a dedicated mask. Moreover, even repeated impressions from the same task (homogeneous masks), when combined, can approach the performance of heterogeneous combinations if sufficiently many impressions are used. Our approach scales more efficiently than existing methods, often requiring orders of magnitude fewer parameters and can function without modification even when task identity is missing. In addition, in the setting where task labels are not given at inference, our algorithm gives an often favorable alternative to the one-shot procedure used by Wortsman et al., 2020. We evaluate our method on a number of well-known image classification datasets and network architectures.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 5 Oct 2022.

Builds on

18 of 31 references.

References · 18

  1. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  2. 2016Learning without Forgettingcited by 2,465
  3. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  6. 2017Continual Learning with Deep Generative Replaycited by 1,152
  7. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  8. 2018Experience Replay for Continual Learningcited by 1,074
  9. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  10. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  11. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
  12. 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 368
6 more
  1. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
  2. 2020Supermasks in Superpositioncited by 223
  3. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  4. 2019Superposition of many models into onecited by 64
  5. 2018Pseudo-Rehearsal: Achieving Deep Reinforcement Learning without Catastrophic Forgettingcited by 46
  6. 2018Adding New Tasks to a Single Network with Weight Transformations using Binary Maskscited by 21

Built on by

Not cited yet.