arXiv:2608.30316cs.CV2026-08

解决多标签增量学习中知识边界模糊问题,提升模型对已知与未知概念的区分能力。

Knowing Beyond the Known: Reinforced Knowledge Specification for Multi-Label Class-Incremental Learning

论文配图:Knowing Beyond the Known: Reinforced Knowledge Specification for Multi-Label Class-Incremental Learning
图 1 · 摘自论文原文
  • 通过分层特征净化模块分离细粒度类别特征,强化语义与视觉特征融合
  • 在MS-COCO上比现有最佳方法高2.7%平均准确率,无需回放缓冲区
  • 适用于需要持续学习新标签的开放场景,如图像标注、智能推荐

现有增量学习方法在多标签场景(MLCIL)中表现受限,源于共现标签与不完整标签带来的目标冲突。本文认为核心障碍在于模型对已知与未知知识边界的模糊认知,导致历史知识遗忘、当前任务学习困难及未来适应性差。为此提出KBK(Knowing Beyond the Known)框架,显式建模已知与未知知识,统一历史、当前与未来学习。具体地,设计分层特征净化模块,从全局特征中解耦细粒度类别特定特征,并以低层视觉特征增强高层语义抽象;引入不确定性感知的召回增强策略,基于分布先验抑制不可靠预测,提升历史知识召回质量。为探测未知,利用语义相关性在共现条件下合成有信息量的未知特征,保留嵌入空间供未来学习。此外,提出类别平衡梯度补偿损失,根据遗忘速度动态重加权梯度反传,缓解异质遗忘。多个基准测试验证了KBK的有效性与鲁棒性,在MS-COCO B0-C10设置下平均准确率领先前人方法2.7%,且无需任何回放缓冲区。

原文摘要 · Abstract (English)

Existing class-incremental learning methods struggle in multi-label scenarios (MLCIL) due to the inherent contradiction of learning objectives arising from co-occurring and incomplete labels. We argue that the core obstacle is the model's ambiguous boundary between known and unknown knowledge, which undermines historical knowledge retention, complicates current task learning, and limits adaptability to future concepts. To address this, we propose KBK (Knowing Beyond the Known), a reinforced knowledge specification framework that explicitly models what is known or not to unify historical, current, and prospective learning. Specifically, to clarify known knowledge, we develop a hierarchical feature purification module that disentangles fine-grained class-specific features from global features, where high-level semantic abstraction is reinforced with low-level visual features. Additionally, an uncertainty-aware recall enhancement strategy suppresses unreliable predictions based on distribution priors, improving the quality of historical recall. For probing the unknown, KBK leverages semantic correlations to synthesize informative unknown features under co-occurring, preserving embedding space for future learning. Furthermore, to mitigate heterogeneous forgetting, we design a category-balanced gradient compensation loss that dynamically reweights gradient backpropagation according to forgetting speeds. Experiments on multiple benchmarks validate the effectiveness and robustness of KBK, which surpasses prior best methods by 2.7% in Avg. Acc on MS-COCO B0-C10 setting even without any replay buffers.

增量学习多标签知识蒸馏持续学习

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