Domain generalization via Inter-domain Alignment and Intra-domain Expansion

被引:11
作者
Hu, Jiajun [1 ,2 ]
Qi, Lei [3 ]
Zhang, Jian [1 ,2 ]
Shi, Yinghuan [1 ,2 ,4 ]
机构
[1] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing, Peoples R China
[2] Nanjing Univ, Natl Inst Healthcare Data Sci, Nanjing, Peoples R China
[3] Southeast Univ, Key Lab New Generat Artificial Intelligence Techno, Minist Educ, Nanjing, Peoples R China
[4] Nanjing Univ, Natl Key Lab Novel Software Technol, 163 Xianlin Rd, Nanjing 210023, Jiangsu, Peoples R China
关键词
Domain generalization; Contrastive learning; Image recognition;
D O I
10.1016/j.patcog.2023.110029
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The performance of traditional deep learning models tends to drop dramatically during being deployed in real-world scenarios when the distribution shift between the seen training and unseen test data occurs. Domain Generalization methods are designed to achieve generalizability to deal with the above issue. Since the features extracted by softmax cross-entropy loss are not adequately domain-invariant, previous works in Domain Generalization have attempted to overcome this problem by employing contrastive-based losses which pull positive pairs (i.e., samples with the same class label) from different domains closer. Unfortunately, these approaches tend to produce an extremely small feature space, which is not robust facing unseen domain and easily overfits to source domains. To address the aforementioned issue, we propose a novel loss named IAIE Loss to simultaneously perform Inter-domain Alignment and Intra-domain Expansion for positive pairs, which facilitates the model to extract domain-invariant features and mitigates overfitting. Specifically, we design two sets of positive samples named "easy positive samples"and "hard positive samples". IAIE Loss pulls the hard positive pairs closer (alignment) while pushing the easy positive pairs apart (expansion). The state-of-the-art results on multiple DG benchmark datasets verify the effectiveness of our method.
引用
收藏
页数:10
相关论文
共 59 条
[1]  
Ahuja K, 2021, ADV NEUR IN, V34
[2]  
Albuquerque I., 2019, arXiv
[3]  
[Anonymous], 2006, P IEEE COMP SOC C CO, P1735
[4]  
Arjovsky M., 2019, arXiv preprint arXiv:1907.02893
[5]  
Balaji Y., 2018, Advances in Neural Information Processing Systems (NeurIPS)
[6]   Recognition in Terra Incognita [J].
Beery, Sara ;
Van Horn, Grant ;
Perona, Pietro .
COMPUTER VISION - ECCV 2018, PT XVI, 2018, 11220 :472-489
[7]  
Blanchard G, 2021, J MACH LEARN RES, V22
[8]   Domain Generalization by Solving Jigsaw Puzzles [J].
Carlucci, Fabio M. ;
D'Innocente, Antonio ;
Bucci, Silvia ;
Caputo, Barbara ;
Tommasi, Tatiana .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :2224-2233
[9]  
Cha J, 2021, ADV NEUR IN
[10]   Domain Generalization by Joint-Product Distribution Alignment [J].
Chen, Sentao ;
Wang, Lei ;
Hong, Zijie ;
Yang, Xiaowei .
PATTERN RECOGNITION, 2023, 134