EHM: Exploring dynamic alignment and hierarchical clustering in unsupervised domain adaptation via high-order moment-guided contrastive learning

IF 6.3 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neural Networks Pub Date : 2025-05-01 Epub Date: 2025-01-22 DOI:10.1016/j.neunet.2025.107188
Tengyue Xu , Jun Dan
{"title":"EHM: Exploring dynamic alignment and hierarchical clustering in unsupervised domain adaptation via high-order moment-guided contrastive learning","authors":"Tengyue Xu ,&nbsp;Jun Dan","doi":"10.1016/j.neunet.2025.107188","DOIUrl":null,"url":null,"abstract":"<div><div>Unsupervised domain adaptation (UDA) aims to annotate unlabeled target domain samples using transferable knowledge learned from the labeled source domain. Optimal transport (OT) is a widely adopted probability metric in transfer learning for quantifying domain discrepancy. However, many existing OT-based UDA methods usually employ an entropic regularization term to solve the OT optimization problem, inevitably resulting in a biased estimation of domain discrepancy. Furthermore, to achieve precise alignment of class distributions, numerous UDA methods commonly employ deep features for guiding contrastive learning, overlooking the loss of discriminative information. Additionally, prior studies frequently use conditional entropy regularization term to cluster unlabeled target samples, which may guide the model toward optimizing in the wrong direction.</div><div>To address the aforementioned issues, this paper proposes a new UDA framework called EHM, which employs a Dynamic Domain Alignment (DDA) strategy, a Reliable High-order Contrastive Alignment (RHCA) strategy, and a Trustworthy Hierarchical Clustering (THC) strategy. Specially, DDA leverages a dynamically adjusted Sinkhorn divergence to measure domain discrepancy, effectively eliminating the biased estimation issue. Our RHCA skillfully conducts contrastive learning in a high-order moment space, significantly enhancing the representation power of transferable features and reducing the domain discrepancy at the class-level. Moreover, THC integrates multi-view information to guide unlabeled samples towards achieving robust clustering. Extensive experiments on various benchmarks demonstrate the effectiveness of our EHM.</div></div>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"185 ","pages":"Article 107188"},"PeriodicalIF":6.3000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S089360802500067X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/22 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Unsupervised domain adaptation (UDA) aims to annotate unlabeled target domain samples using transferable knowledge learned from the labeled source domain. Optimal transport (OT) is a widely adopted probability metric in transfer learning for quantifying domain discrepancy. However, many existing OT-based UDA methods usually employ an entropic regularization term to solve the OT optimization problem, inevitably resulting in a biased estimation of domain discrepancy. Furthermore, to achieve precise alignment of class distributions, numerous UDA methods commonly employ deep features for guiding contrastive learning, overlooking the loss of discriminative information. Additionally, prior studies frequently use conditional entropy regularization term to cluster unlabeled target samples, which may guide the model toward optimizing in the wrong direction.
To address the aforementioned issues, this paper proposes a new UDA framework called EHM, which employs a Dynamic Domain Alignment (DDA) strategy, a Reliable High-order Contrastive Alignment (RHCA) strategy, and a Trustworthy Hierarchical Clustering (THC) strategy. Specially, DDA leverages a dynamically adjusted Sinkhorn divergence to measure domain discrepancy, effectively eliminating the biased estimation issue. Our RHCA skillfully conducts contrastive learning in a high-order moment space, significantly enhancing the representation power of transferable features and reducing the domain discrepancy at the class-level. Moreover, THC integrates multi-view information to guide unlabeled samples towards achieving robust clustering. Extensive experiments on various benchmarks demonstrate the effectiveness of our EHM.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过高阶矩引导对比学习探索无监督域适应中的动态对齐和分层聚类。
无监督域自适应(UDA)旨在利用从标记的源域学习到的可转移知识对未标记的目标域样本进行注释。最优传输(OT)是迁移学习中广泛采用的一种量化域差异的概率度量。然而,现有的许多基于OT的UDA方法通常采用熵正则化项来解决OT优化问题,这不可避免地导致域差异估计的偏差。此外,为了实现类分布的精确对齐,许多UDA方法通常使用深度特征来指导对比学习,忽略了判别信息的丢失。此外,以往的研究经常使用条件熵正则化项对未标记的目标样本进行聚类,这可能会导致模型朝着错误的方向优化。为了解决上述问题,本文提出了一个名为EHM的新的UDA框架,该框架采用了动态域对齐(DDA)策略、可靠高阶对比对齐(RHCA)策略和可信分层聚类(THC)策略。特别地,DDA利用动态调整的Sinkhorn散度来度量域差异,有效地消除了估计偏差问题。我们的RHCA巧妙地在高阶矩空间进行对比学习,显著增强了可转移特征的表示能力,减少了类层面的域差异。此外,THC集成了多视图信息,引导未标记的样本实现鲁棒聚类。在各种基准上进行的大量实验证明了我们的EHM的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Minimizing command timing variability is a key factor in skilled actions Inferring gene regulatory networks via adversarially regularized directed graph autoencoder A continual learning framework with long-term and multiple short-term memory networks A Multi-Agent Continual reinforcement learning framework with multi-Timescale replay and dynamic task classification A survey of recent advances in adversarial attack and defense on vision-language models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1