mlsanityData to 7 Oct 2026

Preventing Catastrophic Forgetting in Continual Learning of New Natural Language Tasks

arXiv 2302.11074 ↗First posted 22 Feb 2023cs.CL cs.AI cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Multi-Task Learning (MTL) is widely-accepted in Natural Language Processing as a standard technique for learning multiple related tasks in one model. Training an MTL model requires having the training data for all tasks available at the same time. As systems usually evolve over time, (e.g., to support new functionalities), adding a new task to an existing MTL model usually requires retraining the model from scratch on all the tasks and this can be time-consuming and computationally expensive. Moreover, in some scenarios, the data used to train the original training may be no longer available, for example, due to storage or privacy concerns. In this paper, we approach the problem of incrementally expanding MTL models' capability to solve new tasks over time by distilling the knowledge of an already trained model on n tasks into a new one for solving n+1 tasks. To avoid catastrophic forgetting, we propose to exploit unlabeled data from the same distributions of the old tasks. Our experiments on publicly available benchmarks show that such a technique dramatically benefits the distillation by preserving the already acquired knowledge (i.e., preventing up to 20% performance drops on old tasks) while obtaining good performance on the incrementally added tasks. Further, we also show that our approach is beneficial in practical settings by using data from a leading voice assistant.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 25 of its 36 references that are in the map. First posted on arXiv 22 Feb 2023.

Builds on

25 of 36 references.

References · 25

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  5. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  6. 2016Learning without Forgettingcited by 2,465
  7. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  8. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  9. 2016Progressive Neural Networkscited by 1,332
  10. 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 791
  11. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 711
  12. 2019Multi-Task Deep Neural Networks for Natural Language Understandingcited by 349
13 more
  1. 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
  2. 2019Continual learning with hypernetworkscited by 267
  3. 2017Incremental Learning of Object Detectors without Catastrophic Forgettingcited by 208
  4. 2019A continual learning survey: Defying forgetting in classification taskscited by 118
  5. 2021Lifelong Pretraining: Continually Adapting Language Models to Emerging Corporacited by 114
  6. 2017Encoder Based Lifelong Learningcited by 102
  7. 2021Continual Learning for Text Classification with Information Disentanglement Based Regularizationcited by 86
  8. 2019BAM! Born-Again Multi-Task Networks for Natural Language Understandingcited by 85
  9. 2021Continual Learning of a Mixed Sequence of Similar and Dissimilar Taskscited by 80
  10. 2021Understanding Continual Learning Settings with Data Distribution Drift Analysiscited by 38
  11. 2019Continual Learning for Sentence Representations Using Conceptorscited by 22
  12. 2021Unsupervised Continual Learning Via Pseudo Labelscited by 18
  13. 2019Multi-Task Networks With Universe, Group, and Task Feature Learningcited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 5; 2026: 3.

10 papers.