跨域目标检测的分层元对齐

IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Yang Li , Shanshan Zhang , Yunan Liu , Jian Yang
{"title":"跨域目标检测的分层元对齐","authors":"Yang Li ,&nbsp;Shanshan Zhang ,&nbsp;Yunan Liu ,&nbsp;Jian Yang","doi":"10.1016/j.engappai.2025.111247","DOIUrl":null,"url":null,"abstract":"<div><div>Unsupervised domain adaptation (UDA) aims to adapt an object detector from a labeled source domain to an unlabeled target domain. In this task, multiple sub-tasks of different nature are involved, yet existing methods simply sum up the losses and train all the sub-tasks jointly. We, however, find that inconsistent optimization goals between different sub-tasks lead to limited adaptation performance. Specifically, from our analysis, we find notable gradient discrepancies between sub-tasks in a domain adaptive object detector, and especially significant conflicts between domain alignment and detection sub-tasks. Based on this analysis, we propose to solve UDA object detection from a multi-task learning perspective. Specifically, we divide all sub-tasks into two groups, and alleviate both inter-group and intra-group inconsistency via a novel Hierarchical Meta Alignment (HMA) method. At the first level, we construct a Meta Optimization Block (MOB) for each inter-group task pair, which is optimized via the Model-Agnostic Meta-Learning (MAML) algorithm. At the second level, all MOBs are optimized sequentially via the Reptile algorithm. Experimental results on various adaptation scenarios show that our proposed method outperforms previous methods.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"158 ","pages":"Article 111247"},"PeriodicalIF":7.5000,"publicationDate":"2025-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hierarchical Meta Alignment for cross-domain object detection\",\"authors\":\"Yang Li ,&nbsp;Shanshan Zhang ,&nbsp;Yunan Liu ,&nbsp;Jian Yang\",\"doi\":\"10.1016/j.engappai.2025.111247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Unsupervised domain adaptation (UDA) aims to adapt an object detector from a labeled source domain to an unlabeled target domain. In this task, multiple sub-tasks of different nature are involved, yet existing methods simply sum up the losses and train all the sub-tasks jointly. We, however, find that inconsistent optimization goals between different sub-tasks lead to limited adaptation performance. Specifically, from our analysis, we find notable gradient discrepancies between sub-tasks in a domain adaptive object detector, and especially significant conflicts between domain alignment and detection sub-tasks. Based on this analysis, we propose to solve UDA object detection from a multi-task learning perspective. Specifically, we divide all sub-tasks into two groups, and alleviate both inter-group and intra-group inconsistency via a novel Hierarchical Meta Alignment (HMA) method. At the first level, we construct a Meta Optimization Block (MOB) for each inter-group task pair, which is optimized via the Model-Agnostic Meta-Learning (MAML) algorithm. At the second level, all MOBs are optimized sequentially via the Reptile algorithm. Experimental results on various adaptation scenarios show that our proposed method outperforms previous methods.</div></div>\",\"PeriodicalId\":50523,\"journal\":{\"name\":\"Engineering Applications of Artificial Intelligence\",\"volume\":\"158 \",\"pages\":\"Article 111247\"},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2025-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Applications of Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0952197625012485\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0952197625012485","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

无监督域自适应(UDA)是一种将目标检测器从标记的源域调整到未标记的目标域的方法。在这个任务中,涉及到多个不同性质的子任务,而现有的方法只是简单地将损失汇总起来,然后联合训练所有的子任务。然而,我们发现不同子任务之间的优化目标不一致导致适应性性能有限。具体地说,从我们的分析中,我们发现领域自适应目标检测器的子任务之间存在显著的梯度差异,特别是领域对齐和检测子任务之间存在显著的冲突。在此基础上,我们提出从多任务学习的角度来解决UDA目标检测问题。具体而言,我们将所有子任务分为两组,并通过一种新的分层元对齐(HMA)方法缓解组间和组内不一致。首先,我们为每个组间任务对构建一个元优化块(MOB),并通过模型不可知元学习(MAML)算法对其进行优化。在第二级,所有mob都是通过Reptile算法依次优化的。在各种自适应场景下的实验结果表明,本文提出的方法优于以往的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hierarchical Meta Alignment for cross-domain object detection
Unsupervised domain adaptation (UDA) aims to adapt an object detector from a labeled source domain to an unlabeled target domain. In this task, multiple sub-tasks of different nature are involved, yet existing methods simply sum up the losses and train all the sub-tasks jointly. We, however, find that inconsistent optimization goals between different sub-tasks lead to limited adaptation performance. Specifically, from our analysis, we find notable gradient discrepancies between sub-tasks in a domain adaptive object detector, and especially significant conflicts between domain alignment and detection sub-tasks. Based on this analysis, we propose to solve UDA object detection from a multi-task learning perspective. Specifically, we divide all sub-tasks into two groups, and alleviate both inter-group and intra-group inconsistency via a novel Hierarchical Meta Alignment (HMA) method. At the first level, we construct a Meta Optimization Block (MOB) for each inter-group task pair, which is optimized via the Model-Agnostic Meta-Learning (MAML) algorithm. At the second level, all MOBs are optimized sequentially via the Reptile algorithm. Experimental results on various adaptation scenarios show that our proposed method outperforms previous methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信