Source-Free Unsupervised Domain Adaptation through Trust-Guided Partitioning and Worst-Case Aligning

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Qing Tian , Lulu Kang
{"title":"Source-Free Unsupervised Domain Adaptation through Trust-Guided Partitioning and Worst-Case Aligning","authors":"Qing Tian ,&nbsp;Lulu Kang","doi":"10.1016/j.knosys.2025.113493","DOIUrl":null,"url":null,"abstract":"<div><div>In source-free unsupervised domain adaptation (SFUDA) tasks, adapting to the target domain without directly accessing the source domain data and relying solely on a pre-trained source domain model and the target domain data is a common challenge. Existing approaches often rely on pseudo-labeling techniques for intra-class clustering to achieve global alignment of classes. However, the presence of noise can lead to incorrect clustering results. In this paper, we introduce a novel approach referred to as Trust-guided Partitioning and Worst-case Aligning (TPWA). We assess the reliability of pseudo-labels by computing the similarity difference between the class centers corresponding to the pseudo-labels and the centers of the most similar classes. Based on this, we perform partitioning and then conduct intra-class clustering only on high-trustworthy samples. We also train a worst-case classifier to predict correctly on high-trustworthy samples and make as many mistakes as possible on low-trustworthy samples, and then adversarially trains feature extractors to align low-trustworthy samples to high-trustworthy samples. This approach leverages the structural information present in the high-trustworthy sample set, improving the robustness of the adaptation. Additionally, we also consider enforcing prediction consistency among neighboring samples to further constrain the pseudo-labels. Extensive experiments demonstrate the superiority of our method in SFUDA tasks.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"318 ","pages":"Article 113493"},"PeriodicalIF":7.2000,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705125005398","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In source-free unsupervised domain adaptation (SFUDA) tasks, adapting to the target domain without directly accessing the source domain data and relying solely on a pre-trained source domain model and the target domain data is a common challenge. Existing approaches often rely on pseudo-labeling techniques for intra-class clustering to achieve global alignment of classes. However, the presence of noise can lead to incorrect clustering results. In this paper, we introduce a novel approach referred to as Trust-guided Partitioning and Worst-case Aligning (TPWA). We assess the reliability of pseudo-labels by computing the similarity difference between the class centers corresponding to the pseudo-labels and the centers of the most similar classes. Based on this, we perform partitioning and then conduct intra-class clustering only on high-trustworthy samples. We also train a worst-case classifier to predict correctly on high-trustworthy samples and make as many mistakes as possible on low-trustworthy samples, and then adversarially trains feature extractors to align low-trustworthy samples to high-trustworthy samples. This approach leverages the structural information present in the high-trustworthy sample set, improving the robustness of the adaptation. Additionally, we also consider enforcing prediction consistency among neighboring samples to further constrain the pseudo-labels. Extensive experiments demonstrate the superiority of our method in SFUDA tasks.
基于信任引导划分和最坏情况对齐的无源无监督域自适应
在无源无监督领域适应(SFUDA)任务中,如何在不直接访问源领域数据的情况下适应目标领域,并完全依赖预先训练好的源领域模型和目标领域数据,是一个常见的挑战。现有方法通常依赖伪标记技术进行类内聚类,以实现类的全局对齐。然而,噪声的存在会导致不正确的聚类结果。在本文中,我们介绍了一种新方法,即信任引导的分区和最坏情况对齐(TPWA)。我们通过计算伪标签对应的类中心与最相似类中心之间的相似性差异来评估伪标签的可靠性。在此基础上,我们进行分区,然后只对可信度高的样本进行类内聚类。我们还训练最坏情况分类器,使其在高可信度样本上预测正确,而在低可信度样本上尽可能多地出错,然后对抗性地训练特征提取器,将低可信度样本与高可信度样本对齐。这种方法充分利用了高可信度样本集中的结构信息,提高了适应的鲁棒性。此外,我们还考虑在相邻样本间强制执行预测一致性,以进一步限制伪标签。广泛的实验证明了我们的方法在 SFUDA 任务中的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信