TY - JOUR
T1 - Mini-batch Dynamic Geometric Embedding for Unsupervised Domain Adaptation
AU - Khan, Siraj
AU - Guo, Yuxin
AU - Ye, Yuzhong
AU - Li, Chunshan
AU - Wu, Qingyao
PY - 2023/6
Y1 - 2023/6
N2 - Unsupervised domain adaptation has gotten a lot of attention due to its ability to improve learning performance in a target domain based on the knowledge extracted from a source domain. Recent studies show that graph-based models can accomplish good results for domain adaptation problems. However, most of these graph-based domain adaptation approaches cannot work in an end-to-end manner, leading to the limited scalable. To address this issue, we propose a learning method named Mini-batch Dynamic Geometric Embedding (MDGE), which seeks to find the relationship between batches source and target samples to learn discriminative representations. Specifically, to build a better graph representing sample relationship, we propose a class-specific sampling strategy to pick up samples which are then used as input of MDGE. Since the samples are effectively selected, we develop a method to dynamically build a subgraph that in turn supports the relationship update and helps the network backbone to extract more discriminative features. Comprehensive experiments on real-world visual datasets demonstrate the effectiveness of the proposed MDGE algorithm. © 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
AB - Unsupervised domain adaptation has gotten a lot of attention due to its ability to improve learning performance in a target domain based on the knowledge extracted from a source domain. Recent studies show that graph-based models can accomplish good results for domain adaptation problems. However, most of these graph-based domain adaptation approaches cannot work in an end-to-end manner, leading to the limited scalable. To address this issue, we propose a learning method named Mini-batch Dynamic Geometric Embedding (MDGE), which seeks to find the relationship between batches source and target samples to learn discriminative representations. Specifically, to build a better graph representing sample relationship, we propose a class-specific sampling strategy to pick up samples which are then used as input of MDGE. Since the samples are effectively selected, we develop a method to dynamically build a subgraph that in turn supports the relationship update and helps the network backbone to extract more discriminative features. Comprehensive experiments on real-world visual datasets demonstrate the effectiveness of the proposed MDGE algorithm. © 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
KW - Domain adaptation
KW - Graph Convolutional Network
KW - Sampling strategy
KW - Transfer learning
UR - http://www.scopus.com/inward/record.url?scp=85160218537&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85160218537&origin=recordpage
U2 - 10.1007/s11063-023-11167-7
DO - 10.1007/s11063-023-11167-7
M3 - RGC 21 - Publication in refereed journal
SN - 1370-4621
VL - 55
SP - 2063
EP - 2080
JO - Neural Processing Letters
JF - Neural Processing Letters
IS - 3
ER -