paper-with-me

홈 › Papers

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

2022-07-26 · Yabin Wang, Zhiwu Huang, Xiaopeng Hong

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 \url{https://github.com/iamwangyabin/S-Prompts}.

📄 PDF Abstract BibTeX arXiv:2207.12819

Code (2)

g-u-n/pycil 공식 구현 pytorch
iamwangyabin/s-prompts 공식 구현 pytorch

Tasks

Continual LearningExemplar-FreeIncremental LearningPrompt Learning

Methods 이 논문이 사용한 방법론

k-NN $k$-Nearest Neighbors is a clustering-based algorithm for classification and regression. It is a a type of instance-based learning as it does not attempt to construct a…

Similar Papers 제목 키워드 기반

The Geometric Occam's Razor Implicit in Deep Learning

2021-11-30 · Benoit Dherin, Michael Munn, David G. T. Barrett

In over-parameterized deep neural networks there can be many possible parameter configurations that fit the training data exactly. However, the properties of these interpolating solutions are poorly understood. We argue …

ARCDeep Learning

In-context learning and Occam's razor

2024-10-17 · Eric Elmoznino, Tom Marty, Tejas Kasetty, Leo Gagnon 외

A central goal of machine learning is generalization. While the No Free Lunch Theorem states that we cannot obtain theoretical guarantees for generalization without further assumptions, in practice we observe that simple…

Data CompressionIn-Context Learning

Think Big, Teach Small: Do Language Models Distil Occam’s Razor?

2021-12-01 · NeurIPS 2021 12 · Gonzalo Jaimovitch-Lopez, David Castellano Falcón, Cesar Ferri, José Hernández-Orallo

Large language models have recently shown a remarkable ability for few-shot learning, including patterns of algorithmic nature. However, it is still an open question to determine what kind of patterns these models can ca…

Few-Shot LearningOpen-Ended Question AnsweringProgram induction

Achieving Occam's Razor: Deep Learning for Optimal Model Reduction

2023-03-24 · Botond B Antal, Anthony G Chesebro, Helmut H Strey, Lilianne R Mujica-Parodi 외

All fields of science depend on mathematical models. Occam's razor refers to the principle that good models should exclude parameters beyond those minimally required to describe the systems they represent. This is becaus…

Deep Learning

Do Language Models Follow Occam's Razor? An Evaluation of Parsimony in Inductive and Abductive Reasoning

2025-09-03 · Yunxin Sun, Abulhair Saparov arxiv

Non-deductive reasoning, encompassing inductive and abductive reasoning, is essential in addressing complex real-world questions. One key feature of inductive and abductive reasoning is that there are many valid hypothes…