用于无监督领域适应的联合分布矩匹配

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-10-31 DOI:10.1016/j.ipm.2024.103944
Bo Zhang , Xiaoming Zhang , Zhibo Zhou , Yun Liu , Yancong Li , Feiran Huang
{"title":"用于无监督领域适应的联合分布矩匹配","authors":"Bo Zhang ,&nbsp;Xiaoming Zhang ,&nbsp;Zhibo Zhou ,&nbsp;Yun Liu ,&nbsp;Yancong Li ,&nbsp;Feiran Huang","doi":"10.1016/j.ipm.2024.103944","DOIUrl":null,"url":null,"abstract":"<div><div>Unsupervised Domain Adaptation (UDA) is designed to transfer acquired knowledge from the source domain to an unlabeled target domain. In this paper, we present a comprehensive approach that seamlessly addresses both source-available and source-free UDA by matching the joint distributions across domains, independent of the availability of source data. Our methodology introduces three innovative criteria to quantitatively assess the divergences between the source and target data, as well as between the source model hypothesis and target data. The criteria decide whether the predicted labels of the target hypothesis are affected by the other knowledge of both domains in the form of a precise formula, thereby enabling targeted supervision in UDA. We evaluate the effectiveness through 37 image and text classification tasks across four different datasets, comparing their performance against the state-of-the-art models. Experiments demonstrate that the proposed approaches obtain superior accuracies for most of the tasks, especially for the source-free setting, which still exceeds HOMDA 0.6% on Office and DRDA 1.5% on Office-Home, even without direct access to source data.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103944"},"PeriodicalIF":7.4000,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Moment matching of joint distributions for unsupervised domain adaptation\",\"authors\":\"Bo Zhang ,&nbsp;Xiaoming Zhang ,&nbsp;Zhibo Zhou ,&nbsp;Yun Liu ,&nbsp;Yancong Li ,&nbsp;Feiran Huang\",\"doi\":\"10.1016/j.ipm.2024.103944\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Unsupervised Domain Adaptation (UDA) is designed to transfer acquired knowledge from the source domain to an unlabeled target domain. In this paper, we present a comprehensive approach that seamlessly addresses both source-available and source-free UDA by matching the joint distributions across domains, independent of the availability of source data. Our methodology introduces three innovative criteria to quantitatively assess the divergences between the source and target data, as well as between the source model hypothesis and target data. The criteria decide whether the predicted labels of the target hypothesis are affected by the other knowledge of both domains in the form of a precise formula, thereby enabling targeted supervision in UDA. We evaluate the effectiveness through 37 image and text classification tasks across four different datasets, comparing their performance against the state-of-the-art models. Experiments demonstrate that the proposed approaches obtain superior accuracies for most of the tasks, especially for the source-free setting, which still exceeds HOMDA 0.6% on Office and DRDA 1.5% on Office-Home, even without direct access to source data.</div></div>\",\"PeriodicalId\":50365,\"journal\":{\"name\":\"Information Processing & Management\",\"volume\":\"62 1\",\"pages\":\"Article 103944\"},\"PeriodicalIF\":7.4000,\"publicationDate\":\"2024-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing & Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0306457324003030\",\"RegionNum\":1,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324003030","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

无监督领域适应(UDA)旨在将源领域中获得的知识转移到未标记的目标领域中。在本文中,我们提出了一种综合方法,通过匹配跨域的联合分布,无缝地解决了有源和无源 UDA 的问题,而与源数据的可用性无关。我们的方法引入了三个创新标准,用于定量评估源数据和目标数据之间的差异,以及源模型假设和目标数据之间的差异。这些标准以精确公式的形式决定目标假设的预测标签是否受到两个领域其他知识的影响,从而在 UDA 中实现有针对性的监督。我们通过四个不同数据集的 37 项图像和文本分类任务来评估其有效性,并将其性能与最先进的模型进行比较。实验表明,所提出的方法在大多数任务中都获得了优异的准确度,尤其是在无源设置中,即使不直接访问源数据,在 Office 和 DRDA 中的准确度仍分别超过 HOMDA 的 0.6% 和 DRDA 的 1.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Moment matching of joint distributions for unsupervised domain adaptation
Unsupervised Domain Adaptation (UDA) is designed to transfer acquired knowledge from the source domain to an unlabeled target domain. In this paper, we present a comprehensive approach that seamlessly addresses both source-available and source-free UDA by matching the joint distributions across domains, independent of the availability of source data. Our methodology introduces three innovative criteria to quantitatively assess the divergences between the source and target data, as well as between the source model hypothesis and target data. The criteria decide whether the predicted labels of the target hypothesis are affected by the other knowledge of both domains in the form of a precise formula, thereby enabling targeted supervision in UDA. We evaluate the effectiveness through 37 image and text classification tasks across four different datasets, comparing their performance against the state-of-the-art models. Experiments demonstrate that the proposed approaches obtain superior accuracies for most of the tasks, especially for the source-free setting, which still exceeds HOMDA 0.6% on Office and DRDA 1.5% on Office-Home, even without direct access to source data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Basis is also explanation: Interpretable Legal Judgment Reasoning prompted by multi-source knowledge Extracting key insights from earnings call transcript via information-theoretic contrastive learning Advancing rule learning in knowledge graphs with structure-aware graph transformer DCIB: Dual contrastive information bottleneck for knowledge-aware recommendation Adaptive CLIP for open-domain 3D model retrieval
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1