mlsanityData to 7 Oct 2026

Domain Incremental Lifelong Learning in an Open World

arXiv 2305.06555 ↗First posted 11 May 2023cs.CL cs.AI cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Lifelong learning (LL) is an important ability for NLP models to learn new tasks continuously. Architecture-based approaches are reported to be effective implementations for LL models. However, it is non-trivial to extend previous approaches to domain incremental LL scenarios since they either require access to task identities in the testing phase or cannot handle samples from unseen tasks. In this paper, we propose Diana: a underlinedynamunderlineic underlinearchitecture-based lifelounderlineng leunderlinearning model that tries to learn a sequence of tasks with a prompt-enhanced language model. Four types of hierarchically organized prompts are used in Diana to capture knowledge from different granularities. Specifically, we dedicate task-level prompts to capture task-specific knowledge to retain high LL performances and maintain instance-level prompts to learn knowledge shared across input samples to improve the model's generalization performance. Moreover, we dedicate separate prompts to explicitly model unseen tasks and introduce a set of prompt key vectors to facilitate knowledge sharing between tasks. Extensive experiments demonstrate that Diana outperforms state-of-the-art LL models, especially in handling unseen tasks. We release the code and data at urlhttps://github.com/AlibabaResearch/DAMO-ConvAI/tree/main/diana.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 56 of its 77 references that are in the map. First posted on arXiv 11 May 2023.

Builds on

56 of 77 references.

References · 56

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  4. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  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. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  9. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
  10. 2016Progressive Neural Networkscited by 1,332
  11. 2017Continual Learning with Deep Generative Replaycited by 1,152
  12. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
38 more
  1. 2015Teaching Machines to Read and Comprehendcited by 1,039
  2. 2021Learning to Prompt for Continual Learningcited by 938
  3. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  4. 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
  5. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  6. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
  7. 2015Scheduled Sampling for Sequence Prediction with Recurrent Neural Networkscited by 779
  8. 2017Seq2SQL: Generating Structured Queries from Natural Language using Reinforcement Learningcited by 679
  9. 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
  10. 2019Three scenarios for continual learningcited by 610
  11. 2017The NarrativeQA Reading Comprehension Challengecited by 590
  12. 2020UnifiedQA: Crossing Format Boundaries With a Single QA Systemcited by 475
  13. 2017Zero-Shot Relation Extraction via Reading Comprehensioncited by 425
  14. 2020LayoutLMv2: Multi-modal Pre-training for Visually-Rich Document Understandingcited by 406
  15. 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 362
  16. 2019Orthogonal Gradient Descent for Continual Learningcited by 361
  17. 2016NewsQA: A Machine Comprehension Datasetcited by 330
  18. 2016A Network-based End-to-End Trainable Task-oriented Dialogue Systemcited by 252
  19. 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 245
  20. 2018The Natural Language Decathlon: Multitask Learning as Question Answeringcited by 235
  21. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  22. 2022UnifiedSKG: Unifying and Multi-Tasking Structured Knowledge Grounding with Text-to-Text Language Modelscited by 231
  23. 2020Supermasks in Superpositioncited by 223
  24. 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
  25. 2019Class-incremental Learning via Deep Model Consolidationcited by 172
  26. 2019DREAM: A Challenge Dataset and Models for Dialogue-Based Reading Comprehensioncited by 156
  27. 2019LAMOL: LAnguage MOdeling for Lifelong Language Learningcited by 156
  28. 2020Adversarial Continual Learningcited by 140
  29. 2018Continuous Learning in Single-Incremental-Task Scenarioscited by 109
  30. 2021LFPT5: A Unified Framework for Lifelong Few-shot Language Learning Based on Prompt Tuning of T5cited by 103
  31. 2019Quoref: A Reading Comprehension Dataset with Questions Requiring Coreferential Reasoningcited by 100
  32. 2021WenLan: Bridging Vision and Language by Large-Scale Multi-Modal Pre-Trainingcited by 84
  33. 2020Continual Learning in Task-Oriented Dialogue Systemscited by 82
  34. 2021Lifelong Person Re-Identification via Adaptive Knowledge Accumulationcited by 57
  35. 2020Deep Open Intent Classification with Adaptive Decision Boundarycited by 56
  36. 2020Continual Learning for Natural Language Generation in Task-oriented Dialog Systemscited by 47
  37. 2023A Survey on Out-of-Distribution Detection in NLPcited by 31
  38. 2018Adding New Tasks to a Single Network with Weight Transformations using Binary Maskscited by 21

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 0; 2026: 1.

5 papers.