S-Prompts Learning with Pre-trained Transformers: An Occam’s Razor for Domain Incremental LearningDownload PDF

Published: 31 Oct 2022, 18:00, Last Modified: 13 Jan 2023, 07:37NeurIPS 2022 AcceptReaders: Everyone
Keywords: Prompts Learning, Pre-trained Transformers, Occam's Razor, Domain Incremental Learning
TL;DR: The proposed S-Prompts goes beyond the common learning paradigm to play a win-win game for domain incremental learning.
Abstract: State-of-the-art deep neural networks are still struggling to address the catastrophic forgetting problem in continual learning. In this paper, we propose one simple paradigm (named as S-Prompting) and two concrete approaches to highly reduce the forgetting degree in one of the most typical continual learning scenarios, i.e., domain increment learning (DIL). The key idea of the paradigm is to learn prompts independently across domains with pre-trained transformers, avoiding the use of exemplars that commonly appear in conventional methods. This results in a win-win game where the prompting can achieve the best for each domain. The independent prompting across domains only requests one single cross-entropy loss for training and one simple K-NN operation as a domain identifier for inference. The learning paradigm derives an image prompt learning approach and a novel language-image prompt learning approach. Owning an excellent scalability (0.03% parameter increase per domain), the best of our approaches achieves a remarkable relative improvement (an average of about 30%) over the best of the state-of-the-art exemplar-free methods for three standard DIL tasks, and even surpasses the best of them relatively by about 6% in average when they use exemplars. Source code is available at https://github.com/iamwangyabin/S-Prompts.
Supplementary Material: pdf
18 Replies