Competitive multi-task Bayesian optimization with an application in hyperparameter tuning of additive manufacturing

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Expert Systems with Applications Pub Date : 2024-10-29 DOI:10.1016/j.eswa.2024.125618
Songhao Wang , Weiming Ou , Zhihao Liu , Bo Du , Rui Wang
{"title":"Competitive multi-task Bayesian optimization with an application in hyperparameter tuning of additive manufacturing","authors":"Songhao Wang ,&nbsp;Weiming Ou ,&nbsp;Zhihao Liu ,&nbsp;Bo Du ,&nbsp;Rui Wang","doi":"10.1016/j.eswa.2024.125618","DOIUrl":null,"url":null,"abstract":"<div><div>Multi-task Bayesian optimization is an effective approach for optimization involving multiple correlated tasks. Typically, either all the tasks or one primary task should be optimized, depending on the objectives of the problems. We consider optimizing the primary task without explicitly pre-determining which is the primary task. Instead, the primary task is defined as the task whose optimal value is the best among all tasks. Due to the black-box nature of the tasks, the decision makers are not able to identify the primary task beforehand. It is thus critical for the algorithms to recognize and optimize the true primary task. Such problems are called competitive multi-task problems and arise in areas including machine learning and engineering design. In this work, we propose a competitive multi-task Bayesian optimization (CMTBO) algorithm to solve competitive multi-task problems. It selects the query point as well as the task to query in each optimization iteration. We theoretically analyze the regret bounds for the algorithm and test their performances on several synthetic and real-world problems. In addition, our algorithm is applied to a material extrusion (an important technology in additive manufacturing) problem to tune the process parameters and select material types.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"262 ","pages":"Article 125618"},"PeriodicalIF":7.5000,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0957417424024850","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

Multi-task Bayesian optimization is an effective approach for optimization involving multiple correlated tasks. Typically, either all the tasks or one primary task should be optimized, depending on the objectives of the problems. We consider optimizing the primary task without explicitly pre-determining which is the primary task. Instead, the primary task is defined as the task whose optimal value is the best among all tasks. Due to the black-box nature of the tasks, the decision makers are not able to identify the primary task beforehand. It is thus critical for the algorithms to recognize and optimize the true primary task. Such problems are called competitive multi-task problems and arise in areas including machine learning and engineering design. In this work, we propose a competitive multi-task Bayesian optimization (CMTBO) algorithm to solve competitive multi-task problems. It selects the query point as well as the task to query in each optimization iteration. We theoretically analyze the regret bounds for the algorithm and test their performances on several synthetic and real-world problems. In addition, our algorithm is applied to a material extrusion (an important technology in additive manufacturing) problem to tune the process parameters and select material types.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
竞争性多任务贝叶斯优化技术在增材制造超参数调整中的应用
多任务贝叶斯优化法是涉及多个相关任务的有效优化方法。通常情况下,应根据问题的目标优化所有任务或一项主要任务。我们考虑的是优化主要任务,而不明确预设哪个是主要任务。相反,主要任务被定义为在所有任务中最优值最好的任务。由于任务的黑箱性质,决策者无法事先确定主要任务。因此,算法识别和优化真正的主要任务至关重要。这类问题被称为竞争性多任务问题,出现在机器学习和工程设计等领域。在这项工作中,我们提出了一种竞争性多任务贝叶斯优化(CMTBO)算法来解决竞争性多任务问题。它在每次优化迭代中选择查询点和查询任务。我们从理论上分析了算法的遗憾界限,并在几个合成问题和实际问题上测试了它们的性能。此外,我们还将算法应用于材料挤压(增材制造中的一项重要技术)问题,以调整工艺参数和选择材料类型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Expert Systems with Applications
Expert Systems with Applications 工程技术-工程:电子与电气
CiteScore
13.80
自引率
10.60%
发文量
2045
审稿时长
8.7 months
期刊介绍: Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.
期刊最新文献
Anticipating impression using textual sentiment based on ensemble LRD model Trusted commonsense knowledge enhanced depression detection based on three-way decision MSU-Net: Multi-Scale self-attention semantic segmentation method for oil-tea camellia planting area extraction in hilly areas of southern China Editorial Board DAN: Neural network based on dual attention for anomaly detection in ICS
×
引用
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