通过双向学习提升类别发现准确率,尤其改善了新类识别效果。
Generalized Category Discovery via Reciprocal Learning and Class-Wise Distribution Regularization
- 主分支与辅助分类分支互为反馈,提升伪标签可靠性
- 在7个数据集上实现全类别最优性能,新类识别显著提升
- 无需额外计算开销,适合实际部署场景
广义类别发现(GCD)旨在利用已标注样本的知识识别未标注样本,其中未标注数据包含基础类和新类。由于聚类方法推理耗时,基于参数的方法更受欢迎。然而,现有方法因自监督不可靠导致基础类区分能力差。为此,我们提出互惠学习框架(RLF),引入一个专门用于基础分类的辅助分支。训练时,主分支将伪基础样本传递给辅助分支;辅助分支则提供更可靠的软标签反哺主分支,形成良性循环。此外,我们引入类间分布正则化(CDR),缓解对基础类的学习偏差,有效提升未标注数据预测置信度,增强新类表现。结合两者,所提方法RLCD在所有类别上均取得优异结果,且额外计算开销可忽略。跨七个GCD数据集的实验证明其优越性。代码已公开于https://github.com/APORduo/RLCD。
原文摘要 · Abstract (English)
Generalized Category Discovery (GCD) aims to identify unlabeled samples by leveraging the base knowledge from labeled ones, where the unlabeled set consists of both base and novel classes. Since clustering methods are time-consuming at inference, parametric-based approaches have become more popular. However, recent parametric-based methods suffer from inferior base discrimination due to unreliable self-supervision. To address this issue, we propose a Reciprocal Learning Framework (RLF) that introduces an auxiliary branch devoted to base classification. During training, the main branch filters the pseudo-base samples to the auxiliary branch. In response, the auxiliary branch provides more reliable soft labels for the main branch, leading to a virtuous cycle. Furthermore, we introduce Class-wise Distribution Regularization (CDR) to mitigate the learning bias towards base classes. CDR essentially increases the prediction confidence of the unlabeled data and boosts the novel class performance. Combined with both components, our proposed method, RLCD, achieves superior performance in all classes with negligible extra computation. Comprehensive experiments across seven GCD datasets validate its superiority. Our codes are available at https://github.com/APORduo/RLCD.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。