无监督条件对抗域自适应的双视角全局和局部范畴关注域对齐。

IF 6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neural Networks Pub Date : 2025-01-08 DOI:10.1016/j.neunet.2025.107129
Jiahua Wu, Yuchun Fang
{"title":"无监督条件对抗域自适应的双视角全局和局部范畴关注域对齐。","authors":"Jiahua Wu, Yuchun Fang","doi":"10.1016/j.neunet.2025.107129","DOIUrl":null,"url":null,"abstract":"<p><p>Conditional adversarial domain adaptation (CADA) is one of the most commonly used unsupervised domain adaptation (UDA) methods. CADA introduces multimodal information to the adversarial learning process to align the distributions of the labeled source domain and unlabeled target domain with mode match. However, CADA provides wrong multimodal information for challenging target features due to utilizing classifier predictions as the multimodal information, leading to distribution mismatch and less robust domain-invariant features. Compared to the recent state-of-the-art UDA methods, CADA also faces poor discriminability on the target domain. To tackle these challenges, we propose a novel unsupervised CADA framework named dual-view global and local category-attentive domain alignment (DV-GLCA). Specifically, to mitigate distribution mismatch and acquire more robust domain-invariant features, we integrate dual-view information into conditional adversarial domain adaptation and then utilize the substantial feature disparity between the two perspectives to better align the multimodal structures of the source and target distributions. Moreover, to learn more discriminative features of the target domain based on dual-view conditional adversarial domain adaptation (DV-CADA), we further propose global category-attentive domain alignment (GCA). We combine coding rate reduction and dual-view centroid alignment in GCA to amplify inter-category domain discrepancies while reducing intra-category domain differences globally. Additionally, to address challenging ambiguous samples during the training phase, we propose local category-attentive domain alignment (LCA). We introduce a new way of using contrastive domain discrepancy in LCA to move ambiguous samples closer to the correct category. Our method demonstrates leading performance on five UDA benchmarks, with extensive experiments showcasing its effectiveness.</p>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"185 ","pages":"107129"},"PeriodicalIF":6.0000,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dual-view global and local category-attentive domain alignment for unsupervised conditional adversarial domain adaptation.\",\"authors\":\"Jiahua Wu, Yuchun Fang\",\"doi\":\"10.1016/j.neunet.2025.107129\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Conditional adversarial domain adaptation (CADA) is one of the most commonly used unsupervised domain adaptation (UDA) methods. CADA introduces multimodal information to the adversarial learning process to align the distributions of the labeled source domain and unlabeled target domain with mode match. However, CADA provides wrong multimodal information for challenging target features due to utilizing classifier predictions as the multimodal information, leading to distribution mismatch and less robust domain-invariant features. Compared to the recent state-of-the-art UDA methods, CADA also faces poor discriminability on the target domain. To tackle these challenges, we propose a novel unsupervised CADA framework named dual-view global and local category-attentive domain alignment (DV-GLCA). Specifically, to mitigate distribution mismatch and acquire more robust domain-invariant features, we integrate dual-view information into conditional adversarial domain adaptation and then utilize the substantial feature disparity between the two perspectives to better align the multimodal structures of the source and target distributions. Moreover, to learn more discriminative features of the target domain based on dual-view conditional adversarial domain adaptation (DV-CADA), we further propose global category-attentive domain alignment (GCA). We combine coding rate reduction and dual-view centroid alignment in GCA to amplify inter-category domain discrepancies while reducing intra-category domain differences globally. Additionally, to address challenging ambiguous samples during the training phase, we propose local category-attentive domain alignment (LCA). We introduce a new way of using contrastive domain discrepancy in LCA to move ambiguous samples closer to the correct category. Our method demonstrates leading performance on five UDA benchmarks, with extensive experiments showcasing its effectiveness.</p>\",\"PeriodicalId\":49763,\"journal\":{\"name\":\"Neural Networks\",\"volume\":\"185 \",\"pages\":\"107129\"},\"PeriodicalIF\":6.0000,\"publicationDate\":\"2025-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neural Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1016/j.neunet.2025.107129\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1016/j.neunet.2025.107129","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

条件对抗域自适应(Conditional adversarial domain adaptation, CADA)是一种最常用的无监督域自适应方法。CADA将多模态信息引入到对抗学习过程中,通过模式匹配来对齐标记的源域和未标记的目标域的分布。然而,由于使用分类器预测作为多模态信息,CADA为具有挑战性的目标特征提供了错误的多模态信息,导致分布不匹配和鲁棒性较差的域不变特征。与最近最先进的UDA方法相比,CADA在目标域上也面临着较差的可分辨性。为了解决这些挑战,我们提出了一种新的无监督CADA框架,称为双视图全局和局部类别关注域对齐(DV-GLCA)。具体而言,为了缓解分布不匹配并获得更鲁棒的域不变特征,我们将双视角信息集成到条件对抗域自适应中,然后利用两个视角之间的大量特征差异来更好地对齐源分布和目标分布的多模态结构。此外,为了学习基于双视图条件对抗性领域自适应(DV-CADA)的目标领域的更多判别特征,我们进一步提出了全局类别关注领域对齐(GCA)。在GCA中,我们将编码率降低和双视图质心对齐结合起来,放大了分类域间的差异,同时在全局上减小了分类域内的差异。此外,为了在训练阶段解决具有挑战性的模糊样本,我们提出了局部类别关注域对齐(LCA)。我们介绍了一种利用LCA中对比域差异的新方法,使模糊样本更接近正确的类别。我们的方法在五个UDA基准测试中表现出领先的性能,并通过大量实验证明了其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dual-view global and local category-attentive domain alignment for unsupervised conditional adversarial domain adaptation.

Conditional adversarial domain adaptation (CADA) is one of the most commonly used unsupervised domain adaptation (UDA) methods. CADA introduces multimodal information to the adversarial learning process to align the distributions of the labeled source domain and unlabeled target domain with mode match. However, CADA provides wrong multimodal information for challenging target features due to utilizing classifier predictions as the multimodal information, leading to distribution mismatch and less robust domain-invariant features. Compared to the recent state-of-the-art UDA methods, CADA also faces poor discriminability on the target domain. To tackle these challenges, we propose a novel unsupervised CADA framework named dual-view global and local category-attentive domain alignment (DV-GLCA). Specifically, to mitigate distribution mismatch and acquire more robust domain-invariant features, we integrate dual-view information into conditional adversarial domain adaptation and then utilize the substantial feature disparity between the two perspectives to better align the multimodal structures of the source and target distributions. Moreover, to learn more discriminative features of the target domain based on dual-view conditional adversarial domain adaptation (DV-CADA), we further propose global category-attentive domain alignment (GCA). We combine coding rate reduction and dual-view centroid alignment in GCA to amplify inter-category domain discrepancies while reducing intra-category domain differences globally. Additionally, to address challenging ambiguous samples during the training phase, we propose local category-attentive domain alignment (LCA). We introduce a new way of using contrastive domain discrepancy in LCA to move ambiguous samples closer to the correct category. Our method demonstrates leading performance on five UDA benchmarks, with extensive experiments showcasing its effectiveness.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Neural Networks
Neural Networks 工程技术-计算机:人工智能
CiteScore
13.90
自引率
7.70%
发文量
425
审稿时长
67 days
期刊介绍: Neural Networks is a platform that aims to foster an international community of scholars and practitioners interested in neural networks, deep learning, and other approaches to artificial intelligence and machine learning. Our journal invites submissions covering various aspects of neural networks research, from computational neuroscience and cognitive modeling to mathematical analyses and engineering applications. By providing a forum for interdisciplinary discussions between biology and technology, we aim to encourage the development of biologically-inspired artificial intelligence.
期刊最新文献
Estimating global phase synchronization by quantifying multivariate mutual information and detecting network structure. Event-based adaptive fixed-time optimal control for saturated fault-tolerant nonlinear multiagent systems via reinforcement learning algorithm. Lie group convolution neural networks with scale-rotation equivariance. Multi-hop interpretable meta learning for few-shot temporal knowledge graph completion. An object detection-based model for automated screening of stem-cells senescence during drug screening.
×
引用
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