用双曲空间提升未知类别发现能力,更适配层级结构数据。
Hyperbolic Category Discovery
- 将骨干网络嵌入从欧氏空间转为双曲空间,捕捉层级关系。
- 在多个公开基准上显著优于传统方法,尤其对未知类别识别提升明显。
- 适合处理具有层次结构的开放世界分类任务,如图像聚类与发现。
广义类别发现(GCD)是一个引人关注的开放世界问题:给定包含已标注和未标注图像的数据集,目标是将所有未标注图像进行分类,无论其属于已知或未知类别。当前主流方法通常在自监督预训练骨干网络末端使用球面投影,在欧氏或球面空间中操作,但这些空间对具有层级结构的数据建模效果不佳。相比之下,双曲空间具有随半径呈指数增长的体积特性,天然适合捕捉来自已知与未知类别的样本层级结构。为此,本文提出在双曲空间中解决类别发现问题,引入HypCD——一种简单而有效的双曲框架,用于学习具有层次感知能力的表示与分类器。HypCD首先将骨干网络的欧氏嵌入空间映射到双曲空间,通过同时考虑双曲距离与样本间夹角,促进后续表示与分类学习,尤其有利于从已知类别向未知类别进行知识迁移。我们在多个公开的GCD基准上进行了全面评估,将其应用于多种基线与前沿方法,均实现显著性能提升。
原文摘要 · Abstract (English)
Generalized Category Discovery (GCD) is an intriguing open-world problem that has garnered increasing attention. Given a dataset that includes both labelled and unlabelled images, GCD aims to categorize all images in the unlabelled subset, regardless of whether they belong to known or unknown classes. In GCD, the common practice typically involves applying a spherical projection operator at the end of the self-supervised pretrained backbone, operating within Euclidean or spherical space. However, both of these spaces have been shown to be suboptimal for encoding samples that possesses hierarchical structures. In contrast, hyperbolic space exhibits exponential volume growth relative to radius, making it inherently strong at capturing the hierarchical structure of samples from both seen and unseen categories. Therefore, we propose to tackle the category discovery challenge in the hyperbolic space. We introduce HypCD, a simple \underline{Hyp}erbolic framework for learning hierarchy-aware representations and classifiers for generalized \underline{C}ategory \underline{D}iscovery. HypCD first transforms the Euclidean embedding space of the backbone network into hyperbolic space, facilitating subsequent representation and classification learning by considering both hyperbolic distance and the angle between samples. This approach is particularly helpful for knowledge transfer from known to unknown categories in GCD. We thoroughly evaluate HypCD on public GCD benchmarks, by applying it to various baseline and state-of-the-art methods, consistently achieving significant improvements.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。