arXiv:2503.07035cs.CV2025-03

提出新框架MiCo,解决增量学习中任务间与任务内分布混乱问题。

Universal Incremental Learning: Mitigating Confusion from Inter- and Intra-task Distribution Randomness

  • 设计多目标学习+方向重校准,应对任务间分布随机性
  • 引入幅度重校准,缓解类分布不均导致的优化偏移
  • 在真实动态场景下表现更优,适合复杂增量学习场景

增量学习旨在学习新任务的同时避免对旧任务的灾难性遗忘。现有方法通常假设新增任务仅增加新类别或新领域(即类别增量学习、领域增量学习),或以静态规模无差别增加(即通用增量学习,VIL),这在不可预测的现实环境中限制了应用。本文研究更具普遍性的通用增量学习(UIL),其中模型既无法预知新增类别或领域的类型,也无法确定每次任务的增量规模。这种不确定性导致模型难以准确学习所有任务分布的知识,且在每个任务内部知识分布上难以均衡聚焦,从而引发任务间与任务内分布随机性带来的混淆。为此,我们提出简单而有效的框架MiCo,以缓解双重混淆:在任务间层面,采用多目标学习策略并结合方向重校准模块减少冲突梯度;在任务内层面,引入幅度重校准模块缓解不平衡类别分布造成的不对称优化。在三个基准数据集上的大量实验表明,该方法在UIL和VIL场景下均优于现有最先进方法。

原文摘要 · Abstract (English)

Incremental learning (IL) aims to overcome catastrophic forgetting of previous tasks while learning new ones. Existing IL methods make strong assumptions that the incoming task type will either only increases new classes or domains (i.e. Class IL, Domain IL), or increase by a static scale in a class- and domain-agnostic manner (i.e. Versatile IL (VIL)), which greatly limit their applicability in the unpredictable and dynamic wild. In this work, we investigate $\textbf{Universal Incremental Learning (UIL)}$, where a model neither knows which new classes or domains will increase along sequential tasks, nor the scale of the increments within each task. This uncertainty prevents the model from confidently learning knowledge from all task distributions and symmetrically focusing on the diverse knowledge within each task distribution. Consequently, UIL presents a more general and realistic IL scenario, making the model face confusion arising from inter-task and intra-task distribution randomness. To $\textbf{Mi}$tigate both $\textbf{Co}$nfusion, we propose a simple yet effective framework for UIL, named $\textbf{MiCo}$. At the inter-task distribution level, we employ a multi-objective learning scheme to enforce accurate and deterministic predictions, and its effectiveness is further enhanced by a direction recalibration module that reduces conflicting gradients. Moreover, at the intra-task distribution level, we introduce a magnitude recalibration module to alleviate asymmetrical optimization towards imbalanced class distribution. Extensive experiments on three benchmarks demonstrate the effectiveness of our method, outperforming existing state-of-the-art methods in both the UIL scenario and the VIL scenario. Our code will be available at $\href{https://github.com/rolsheng/UIL}{here}$.

增量学习分布随机性多任务优化

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