arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.10573cs.CVcs.LG
收藏

基于度量相似学习的最优传输的领域泛化

Domain Generalization via Optimal Transport with Metric Similarity Learning

Laval University(拉瓦尔大学);Beijing University of Posts and Telecommunications(北京邮电大学);University of Western Ontario(西安大略大学)

Fan Zhou, Zhuqing Jiang, Changjian Shui, Boyu Wang, Brahim Chaib-draa

摘要:

将知识推广到数据和标签不可用的未知领域,对于机器学习模型至关重要。我们解决了领域泛化问题,从多个源域学习,并推广到一个目标域未知的统计数据。关键的思想是提取所有领域的基本不变特征。以往的领域泛化方法主要集中在学习不变特征和堆叠学习的特征从每个源域推广到一个新的目标域,而忽略了标签信息,这将导致不可区分的特征和模糊的分类边界。为此,一种可能的解决方案是在提取不变特征时约束标签相似性,并利用标签相似性来实现跨域特征的类特定内聚和分离。因此,我们采用Wasserstein距离的最佳传输,这可以约束类标签相似性,用于对抗训练,并进一步部署度量学习目标,以利用标签信息来实现可区分的分类边界。实证结果表明,我们提出的方法可以优于大多数的基线。此外,消融研究也证明了我们的方法的每个组成部分的有效性。

英文摘要:

Generalizing knowledge to unseen domains, where data and labels are unavailable, is crucial for machine learning models. We tackle the domain generalization problem to learn from multiple source domains and generalize to a target domain with unknown statistics. The crucial idea is to extract the underlying invariant features across all the domains. Previous domain generalization approaches mainly focused on learning invariant features and stacking the learned features from each source domain to generalize to a new target domain while ignoring the label information, which will lead to indistinguishable features with an ambiguous classification boundary. For this, one possible solution is to constrain the label-similarity when extracting the invariant features and to take advantage of the label similarities for class-specific cohesion and separation of features across domains. Therefore we adopt optimal transport with Wasserstein distance, which could constrain the class label similarity, for adversarial training and also further deploy a metric learning objective to leverage the label information for achieving distinguishable classification boundary. Empirical results show that our proposed method could outperform most of the baselines. Furthermore, ablation studies also demonstrate the effectiveness of each component of our method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑