arXiv:2409.10956cs.CVcs.AI2024-09ECCV被引 10

提出可同时应对类别与领域增量的新型持续学习框架

Versatile Incremental Learning: Towards Class and Domain-Agnostic Incremental Learning

论文配图:Versatile Incremental Learning: Towards Class and Domain-Agnostic Incremental Learning
图 1 · 摘自论文原文
  • 设计新正则化方法避免旧知识混淆
  • 通过动态扩展分类器解决跨域类别冲突
  • 适用于未知增量模式的场景,适合实际部署

持续学习旨在从顺序输入任务中积累知识,同时克服灾难性遗忘。现有方法通常假设新任务仅增加类别或领域,分别称为类别增量学习(CIL)或领域增量学习(DIL)。本文提出更具挑战性且更贴近现实的通用增量学习(VIL)场景:模型无法预知下个任务将新增类别或领域。在此场景下,模型面临类内域混淆和域间类混淆问题,导致新知识难以有效积累。为此,我们提出简单有效的框架ICON,基于可学习模块的迁移,设计新的正则化方法CAST,以控制模型避免与已有知识混淆。此外,引入可扩展输出节点的增量分类器(IC),解决同一类别在不同域中被覆盖的问题,同时保留旧知识。我们在三个基准上进行大量实验,验证了方法在各类场景下的有效性,尤其在任务类型随机变化时表现优异。代码已开源。

原文摘要 · Abstract (English)

Incremental Learning (IL) aims to accumulate knowledge from sequential input tasks while overcoming catastrophic forgetting. Existing IL methods typically assume that an incoming task has only increments of classes or domains, referred to as Class IL (CIL) or Domain IL (DIL), respectively. In this work, we consider a more challenging and realistic but under-explored IL scenario, named Versatile Incremental Learning (VIL), in which a model has no prior of which of the classes or domains will increase in the next task. In the proposed VIL scenario, the model faces intra-class domain confusion and inter-domain class confusion, which makes the model fail to accumulate new knowledge without interference with learned knowledge. To address these issues, we propose a simple yet effective IL framework, named Incremental Classifier with Adaptation Shift cONtrol (ICON). Based on shifts of learnable modules, we design a novel regularization method called Cluster-based Adaptation Shift conTrol (CAST) to control the model to avoid confusion with the previously learned knowledge and thereby accumulate the new knowledge more effectively. Moreover, we introduce an Incremental Classifier (IC) which expands its output nodes to address the overwriting issue from different domains corresponding to a single class while maintaining the previous knowledge. We conducted extensive experiments on three benchmarks, showcasing the effectiveness of our method across all the scenarios, particularly in cases where the next task can be randomly altered. Our implementation code is available at https://github.com/KHU-AGI/VIL.

持续学习增量学习通用学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。