arXiv:2503.10699cs.CVcs.AI2025-03被引 1

测试时发现新类别,不重训模型也能自动识别未知类

Test-Time Discovery via Hashing Memory

  • 用哈希记忆库对比测试样本,区分新旧类别
  • 在CIFAR-100上新类识别准确率达68.3%,旧类性能几乎不变
  • 适合部署后需持续识别新类别的实际场景

我们提出测试时发现(TTD)这一新任务,应对测试阶段的类别漂移问题,要求模型在识别新类别的同时保留已有知识。核心挑战在于区分新发现类别与已知类别。为此,我们提出一种无需训练的基于哈希的记忆机制,通过特征尺度和方向构建哈希表示,利用局部敏感哈希(LSH)高效聚合相似样本,实现测试样本与历史实例的快速比对。同时设计协同分类策略:已知类由原型分类器处理,新类由基于LSH的分类器识别。引入自校正机制,通过哈希邻居检索优化记忆标签,提升分类稳定性与准确性。实验表明,该方法在保持已知类性能的前提下有效发现新类别,在CIFAR-100上新类识别准确率达68.3%。代码已开源。

原文摘要 · Abstract (English)

We introduce Test-Time Discovery (TTD) as a novel task that addresses class shifts during testing, requiring models to simultaneously identify emerging categories while preserving previously learned ones. A key challenge in TTD is distinguishing newly discovered classes from those already identified. To address this, we propose a training-free, hash-based memory mechanism that enhances class discovery through fine-grained comparisons with past test samples. Leveraging the characteristics of unknown classes, our approach introduces hash representation based on feature scale and directions, utilizing Locality-Sensitive Hashing (LSH) for efficient grouping of similar samples. This enables test samples to be easily and quickly compared with relevant past instances. Furthermore, we design a collaborative classification strategy, combining a prototype classifier for known classes with an LSH-based classifier for novel ones. To enhance reliability, we incorporate a self-correction mechanism that refines memory labels through hash-based neighbor retrieval, ensuring more stable and accurate class assignments. Experimental results demonstrate that our method achieves good discovery of novel categories while maintaining performance on known classes, establishing a new paradigm in model testing. Our code is available at https://github.com/fanlyu/ttd.

测试时学习类别发现哈希记忆零样本识别

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