解决标签数据稀疏下的长尾分布问题,提升跨域泛化性能
Information Maximization for Long-Tailed Semi-Supervised Domain Generalization
- 基于信息最大化原理,优化特征与隐式标签的互信息
- 在两种图像模态上显著提升现有SOTA方法在长尾分布下的准确率
- 无需修改主干模型,可无缝集成到主流半监督域泛化框架
半监督域泛化(SSDG)在标注数据稀缺但跨域无标签样本充足时展现出优势。然而,现有方法在长尾类别分布下表现严重退化,而这是现实场景中常见的情况。为此,本文提出IMaX,一种基于信息最大化原则的新型目标函数,在利用有限标注样本监督的同时,最大化特征与隐式标签间的互信息。通过引入α-熵项,缓解标准互信息中边际熵带来的类别平衡偏差,从而有效应对任意类别分布。IMaX可无缝嵌入当前主流SSDG方法,实证结果表明其在两种不同图像模态上均能持续提升性能。
原文摘要 · Abstract (English)
Semi-supervised domain generalization (SSDG) has recently emerged as an appealing alternative to tackle domain generalization when labeled data is scarce but unlabeled samples across domains are abundant. In this work, we identify an important limitation that hampers the deployment of state-of-the-art methods on more challenging but practical scenarios. In particular, state-of-the-art SSDG severely suffers in the presence of long-tailed class distributions, an arguably common situation in real-world settings. To alleviate this limitation, we propose IMaX, a simple yet effective objective based on the well-known InfoMax principle adapted to the SSDG scenario, where the Mutual Information (MI) between the learned features and latent labels is maximized, constrained by the supervision from the labeled samples. Our formulation integrates an α-entropic objective, which mitigates the class-balance bias encoded in the standard marginal entropy term of the MI, thereby better handling arbitrary class distributions. IMaX can be seamlessly plugged into recent state-of-the-art SSDG, consistently enhancing their performance, as demonstrated empirically across two different image modalities.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。