arXiv:2503.10526cs.CV2025-03CVPR被引 9

解决跨模态检索中少数样本主导邻居问题,提升检索准确率

NeighborRetr: Balancing Hub Centrality in Cross-Modal Retrieval

  • 训练时直接平衡枢纽样本学习,动态调整邻居关系
  • 在多个基准上达到当前最优检索性能
  • 对分布偏移有强鲁棒性,适合真实场景应用

跨模态检索旨在弥合视觉与文本等不同模态间的语义鸿沟,实现精准跨模态检索。尽管以CLIP为代表的模型在对齐跨模态表示方面取得显著进展,但持续存在的瓶颈是枢纽问题:少量样本(枢纽)频繁成为最近邻,导致表征偏差并降低检索精度。现有方法多依赖事后的归一化技术缓解此问题,但需预先知晓数据分布,在真实场景中难以适用。本文提出一种新方法NeighborRetr,直接在训练阶段缓解枢纽问题,通过有效平衡枢纽学习并自适应调整各类邻居关系,不仅缓解了枢纽现象,还提升了检索性能,在多个跨模态检索基准上达到领先水平。此外,NeighborRetr在面对显著分布偏移的新领域时仍表现出良好泛化能力,凸显其在实际应用中的有效性。代码已公开于https://github.com/zzezze/NeighborRetr。

原文摘要 · Abstract (English)

Cross-modal retrieval aims to bridge the semantic gap between different modalities, such as visual and textual data, enabling accurate retrieval across them. Despite significant advancements with models like CLIP that align cross-modal representations, a persistent challenge remains: the hubness problem, where a small subset of samples (hubs) dominate as nearest neighbors, leading to biased representations and degraded retrieval accuracy. Existing methods often mitigate hubness through post-hoc normalization techniques, relying on prior data distributions that may not be practical in real-world scenarios. In this paper, we directly mitigate hubness during training and introduce NeighborRetr, a novel method that effectively balances the learning of hubs and adaptively adjusts the relations of various kinds of neighbors. Our approach not only mitigates the hubness problem but also enhances retrieval performance, achieving state-of-the-art results on multiple cross-modal retrieval benchmarks. Furthermore, NeighborRetr demonstrates robust generalization to new domains with substantial distribution shifts, highlighting its effectiveness in real-world applications. We make our code publicly available at: https://github.com/zzezze/NeighborRetr .

跨模态检索枢纽问题表征学习

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