Learning to Diversify for Single Domain Generalization

被引:131
作者
Wang, Zijian [1 ]
Luo, Yadan [1 ]
Qiu, Ruihong [1 ]
Huang, Zi [1 ]
Baktashmotlagh, Mahsa [1 ]
机构
[1] Univ Queensland, Brisbane, Qld, Australia
来源
2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021) | 2021年
基金
澳大利亚研究理事会;
关键词
D O I
10.1109/ICCV48922.2021.00087
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Domain generalization (DG) aims to generalize a model trained on multiple source (i.e., training) domains to a distributionally different target (i.e., test) domain. In contrast to the conventional DG that strictly requires the availability of multiple source domains, this paper considers a more realistic yet challenging scenario, namely Single Domain Generalization (Single-DG), where only one source domain is available for training. In this scenario, the limited diversity may jeopardize the model generalization on unseen target domains. To tackle this problem, we propose a style-complement module to enhance the generalization power of the model by synthesizing images from diverse distributions that are complementary to the source ones. More specifically, we adopt a tractable upper bound of mutual information (MI) between the generated and source samples and perform a two-step optimization iteratively: (1) by minimizing the MI upper bound approximation for each sample pair, the generated images are forced to be diversified from the source samples; (2) subsequently, we maximize the MI between the samples from the same semantic category, which assists the network to learn discriminative features from diverse-styled images. Extensive experiments on three benchmark datasets demonstrate the superiority of our approach, which surpasses the state-of-the-art single-DG methods by up to 25.14%. The code will be publicly available at https://github.com/BUserName/Learning_to_diversify
引用
收藏
页码:814 / 823
页数:10
相关论文
共 45 条
[1]   Unsupervised Domain Adaptation by Domain Invariant Projection [J].
Baktashmotlagh, Mahsa ;
Harandi, Mehrtash T. ;
Lovell, Brian C. ;
Salzmann, Mathieu .
2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, :769-776
[2]  
Balaji Y, 2018, ADV NEUR IN, V31
[3]   A theory of learning from different domains [J].
Ben-David, Shai ;
Blitzer, John ;
Crammer, Koby ;
Kulesza, Alex ;
Pereira, Fernando ;
Vaughan, Jennifer Wortman .
MACHINE LEARNING, 2010, 79 (1-2) :151-175
[4]  
Bousmalis Konstantinos, 2016, NEURIPS
[5]   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
[6]   Learning to Balance Specificity and Invariance for In and Out of Domain Generalization [J].
Chattopadhyay, Prithvijit ;
Balaji, Yogesh ;
Hoffman, Judy .
COMPUTER VISION - ECCV 2020, PT IX, 2020, 12354 :301-318
[7]  
Cheng PY, 2020, PR MACH LEARN RES, V119
[8]  
Csurka G, 2017, ADV COMPUT VIS PATT, P1, DOI 10.1007/978-3-319-58347-1_1
[9]  
Daume III Hal, 2010, NeurIPS
[10]  
Denker John S., 1988, NeurIPS