TY - JOUR
T1 - Explicitly fusing plug-and-play guidance of source prototype into target subspace for domain adaptation
AU - Luo, Hao
AU - Tian, Zhiqiang
AU - Jiao, Panpan
AU - Liu, Meiqin
AU - Du, Shaoyi
AU - Nan, Kai
N1 - Publisher Copyright:
© 2025 Elsevier B.V.
PY - 2025/11
Y1 - 2025/11
N2 - The commonly used maximum mean discrepancy (MMD) criterion has two main drawbacks when reducing cross-domain distribution gaps: firstly, it reduces the distribution discrepancy in a global manner, potentially ignoring local structural information between domains, and secondly, its performance heavily relies on the often-unstable pseudo-label refinement process. To solve these problems, we introduce two universal plug-and-play modules: dynamic prototype pursuit (DPP) regularization and bi-branch self-training (BST) mechanism. Firstly, DPP introduces a new inter-class perspective to stabilize MMD by assigning a source prototype to each target sample. This allows us to utilize inter-class data structure information for better alignment. Next, BST is a novel non-parametric pseudo-label refinement mechanism that updates pseudo labels of target data using a classifier trained on the same distribution as the target domain. This avoids the distribution gap issue, making BST more likely to generate accurate target pseudo labels. Importantly, DPP and BST are universal plug-and-play modules for shallow domain adaptation methods. To demonstrate this, experiments of 3 MMD-based models incorporated with DPP and BST are conducted on Office-Caltech, Reuters21578, and Berlin-Emovo-Tess datasets. Experimental results show that these models incorporated with DPP and BST generally achieve better results compared to not using DPP and BST in terms of multiple metrics including accuracy, F1-score, MCC, and false positive rates. Code of 3 different DA methods enhanced by the plug-and-play DPP and BST is available at: https://github.com/Evelhz/DPP-and-BST.
AB - The commonly used maximum mean discrepancy (MMD) criterion has two main drawbacks when reducing cross-domain distribution gaps: firstly, it reduces the distribution discrepancy in a global manner, potentially ignoring local structural information between domains, and secondly, its performance heavily relies on the often-unstable pseudo-label refinement process. To solve these problems, we introduce two universal plug-and-play modules: dynamic prototype pursuit (DPP) regularization and bi-branch self-training (BST) mechanism. Firstly, DPP introduces a new inter-class perspective to stabilize MMD by assigning a source prototype to each target sample. This allows us to utilize inter-class data structure information for better alignment. Next, BST is a novel non-parametric pseudo-label refinement mechanism that updates pseudo labels of target data using a classifier trained on the same distribution as the target domain. This avoids the distribution gap issue, making BST more likely to generate accurate target pseudo labels. Importantly, DPP and BST are universal plug-and-play modules for shallow domain adaptation methods. To demonstrate this, experiments of 3 MMD-based models incorporated with DPP and BST are conducted on Office-Caltech, Reuters21578, and Berlin-Emovo-Tess datasets. Experimental results show that these models incorporated with DPP and BST generally achieve better results compared to not using DPP and BST in terms of multiple metrics including accuracy, F1-score, MCC, and false positive rates. Code of 3 different DA methods enhanced by the plug-and-play DPP and BST is available at: https://github.com/Evelhz/DPP-and-BST.
KW - Bi-branch self-training
KW - Dynamic prototype pursuit
KW - Shallow domain adaptation
KW - Subspace learning
UR - https://www.scopus.com/pages/publications/105005073093
U2 - 10.1016/j.inffus.2025.103197
DO - 10.1016/j.inffus.2025.103197
M3 - 文章
AN - SCOPUS:105005073093
SN - 1566-2535
VL - 123
JO - Information Fusion
JF - Information Fusion
M1 - 103197
ER -