Brain-Inspired Fast- and Slow-Update Prompt Tuning for Few-Shot Class-Incremental Learning

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE transactions on neural networks and learning systems Pub Date : 2024-09-18 DOI:10.1109/TNNLS.2024.3454237
Hang Ran;Xingyu Gao;Lusi Li;Weijun Li;Songsong Tian;Gang Wang;Hailong Shi;Xin Ning
{"title":"Brain-Inspired Fast- and Slow-Update Prompt Tuning for Few-Shot Class-Incremental Learning","authors":"Hang Ran;Xingyu Gao;Lusi Li;Weijun Li;Songsong Tian;Gang Wang;Hailong Shi;Xin Ning","doi":"10.1109/TNNLS.2024.3454237","DOIUrl":null,"url":null,"abstract":"Few-shot class-incremental learning (FSCIL) aims to learn new classes incrementally with a limited number of samples per class. Foundation models combined with prompt tuning showcase robust generalization and zero-shot learning (ZSL) capabilities, endowing them with potential advantages in transfer capabilities for FSCIL. However, existing prompt tuning methods excel in optimizing for stationary datasets, diverging from the inherent sequential nature in the FSCIL paradigm. To address this issue, taking inspiration from the “fast and slow mechanism” of the complementary learning systems (CLSs) in the brain, we present fast- and slow-update prompt tuning FSCIL (FSPT-FSCIL), a brain-inspired prompt tuning method for transferring foundation models to the FSCIL task. We categorize the prompts into two groups: fast-update prompts and slow-update prompts, which are interactively trained through meta-learning. Fast-update prompts aim to learn new knowledge within a limited number of iterations, while slow-update prompts serve as meta-knowledge and aim to strike a balance between rapid learning and avoiding catastrophic forgetting. Through experiments on multiple benchmark tests, we demonstrate the effectiveness and superiority of FSPT-FSCIL. The code is available at <uri>https://github.com/qihangran/FSPT-FSCIL</uri>.","PeriodicalId":13303,"journal":{"name":"IEEE transactions on neural networks and learning systems","volume":"36 7","pages":"13417-13430"},"PeriodicalIF":8.9000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on neural networks and learning systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10682795/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Few-shot class-incremental learning (FSCIL) aims to learn new classes incrementally with a limited number of samples per class. Foundation models combined with prompt tuning showcase robust generalization and zero-shot learning (ZSL) capabilities, endowing them with potential advantages in transfer capabilities for FSCIL. However, existing prompt tuning methods excel in optimizing for stationary datasets, diverging from the inherent sequential nature in the FSCIL paradigm. To address this issue, taking inspiration from the “fast and slow mechanism” of the complementary learning systems (CLSs) in the brain, we present fast- and slow-update prompt tuning FSCIL (FSPT-FSCIL), a brain-inspired prompt tuning method for transferring foundation models to the FSCIL task. We categorize the prompts into two groups: fast-update prompts and slow-update prompts, which are interactively trained through meta-learning. Fast-update prompts aim to learn new knowledge within a limited number of iterations, while slow-update prompts serve as meta-knowledge and aim to strike a balance between rapid learning and avoiding catastrophic forgetting. Through experiments on multiple benchmark tests, we demonstrate the effectiveness and superiority of FSPT-FSCIL. The code is available at https://github.com/qihangran/FSPT-FSCIL.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大脑启发的快速和慢速更新提示调谐,用于少数几次类增量学习
少数次类增量学习(FSCIL)旨在以有限的样本数量增量学习新类。结合即时调优的基础模型显示出鲁棒的泛化和零次学习(zero-shot learning, ZSL)能力,使其在FSCIL的迁移能力方面具有潜在优势。然而,现有的提示调优方法在平稳数据集的优化方面表现出色,偏离了FSCIL范式固有的时序性。为了解决这一问题,我们从大脑中互补学习系统(cls)的“快慢机制”中获得灵感,提出了快速和慢速更新提示调谐FSCIL (FSPT-FSCIL),这是一种将基础模型转移到FSCIL任务的脑启发提示调谐方法。我们将提示分为两组:快速更新提示和慢更新提示,它们通过元学习进行交互式训练。快速更新提示旨在在有限的迭代次数内学习新知识,而慢更新提示作为元知识,旨在在快速学习和避免灾难性遗忘之间取得平衡。通过多个基准测试的实验,我们证明了FSPT-FSCIL的有效性和优越性。代码可在https://github.com/qihangran/FSPT-FSCIL上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE transactions on neural networks and learning systems
IEEE transactions on neural networks and learning systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
CiteScore
23.80
自引率
9.60%
发文量
2102
审稿时长
3-8 weeks
期刊介绍: The focus of IEEE Transactions on Neural Networks and Learning Systems is to present scholarly articles discussing the theory, design, and applications of neural networks as well as other learning systems. The journal primarily highlights technical and scientific research in this domain.
期刊最新文献
Class-Incremental Cloud-Device Collaborative Adaptation With Contrastive Learning in Dynamic Changing Environments. ATTE: An Innovative Ensemble Learning Method With Age-Group-Guided Fine-Tuning for Improving Personalized Blood Pressure Estimation Resource-Efficient and Layer Interdependence-Aware CNN Pruning Leveraging Filter Replacement. Logits-Level Balanced Machine Unlearning for LLM-Based Recommendation System. A Multiobjective Evolutionary Algorithm Based on Bipopulation With Uniform Sampling for Neural Architecture Search.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1