arXiv:2511.00573cs.CV2025-11NeurIPS被引 8

提出频域引导的类别发现框架,应对数据分布偏移挑战

Generalized Category Discovery under Domain Shift: A Frequency Domain Perspective

  • 基于频域幅度差异分离已知与未知领域样本
  • 设计跨域与域内频域扰动策略提升鲁棒性
  • 通过难聚类样本重采样优化未知类别识别

广义类别发现(GCD)旨在利用已知类别的标注样本,对包含已知和未知类别的无标签数据进行聚类。现有方法在标准条件下表现优异,但在分布偏移下性能显著下降。本文提出更贴近实际的领域偏移广义类别发现(DS_GCD)任务,其中无标签数据不仅包含未知类别,还包含未知领域的样本。为此,我们提出频率引导的广义类别发现框架(FREE),通过频域信息增强模型在分布偏移下的类别发现能力。首先,提出基于频域幅度差异的领域分离策略,将样本划分为已知与未知领域。其次,设计两种频域扰动策略:跨域策略通过交换不同领域间的幅值成分适应新分布,域内策略增强对未知领域内部变化的鲁棒性。同时,扩展自监督对比目标与语义聚类损失以更好指导训练。最后,引入聚类难度感知重采样技术,自适应聚焦于更难聚类的类别。大量实验表明,该方法在多个基准数据集上有效缓解分布偏移影响,显著提升已知与未知类别的发现性能。

原文摘要 · Abstract (English)

Generalized Category Discovery (GCD) aims to leverage labeled samples from known categories to cluster unlabeled data that may include both known and unknown categories. While existing methods have achieved impressive results under standard conditions, their performance often deteriorates in the presence of distribution shifts. In this paper, we explore a more realistic task: Domain-Shifted Generalized Category Discovery (DS\_GCD), where the unlabeled data includes not only unknown categories but also samples from unknown domains. To tackle this challenge, we propose a \textbf{\underline{F}}requency-guided Gene\textbf{\underline{r}}alized Cat\textbf{\underline{e}}gory Discov\textbf{\underline{e}}ry framework (FREE) that enhances the model's ability to discover categories under distributional shift by leveraging frequency-domain information. Specifically, we first propose a frequency-based domain separation strategy that partitions samples into known and unknown domains by measuring their amplitude differences. We then propose two types of frequency-domain perturbation strategies: a cross-domain strategy, which adapts to new distributions by exchanging amplitude components across domains, and an intra-domain strategy, which enhances robustness to intra-domain variations within the unknown domain. Furthermore, we extend the self-supervised contrastive objective and semantic clustering loss to better guide the training process. Finally, we introduce a clustering-difficulty-aware resampling technique to adaptively focus on harder-to-cluster categories, further enhancing model performance. Extensive experiments demonstrate that our method effectively mitigates the impact of distributional shifts across various benchmark datasets and achieves superior performance in discovering both known and unknown categories.

类别发现频域分析分布偏移聚类优化

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