Multi-indicator based multi-objective evolutionary algorithm with application to neural architecture search

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE International Journal of Machine Learning and Cybernetics Pub Date : 2024-08-27 DOI:10.1007/s13042-024-02300-6
Oladayo S. Ajani, Daison Darlan, Dzeuban Fenyom Ivan, Rammohan Mallipeddi
{"title":"Multi-indicator based multi-objective evolutionary algorithm with application to neural architecture search","authors":"Oladayo S. Ajani, Daison Darlan, Dzeuban Fenyom Ivan, Rammohan Mallipeddi","doi":"10.1007/s13042-024-02300-6","DOIUrl":null,"url":null,"abstract":"<p><span>\\({\\mathbf{I}}_{{\\mathbf{SDE}}^{+}}\\)</span> is proven to be one of the leading scalable indicator for evolutionary multi and many-objective optimization. However, it fails to segregate members of a given population beyond the first front as a large number of solutions in the population have identical <span>\\({\\mathbf{I}}_{{\\mathbf{SDE}}^{+}}\\)</span> values. This mainly affects the performance of the algorithm when handling optimization problems with lower objectives. Consequently, we hypothesize that the overall performance of the algorithm can be further improved by introducing a categorization mechanism similar to the categorization of Pareto Fronts (PFs) in dominance-based methods. Therefore, in this work, we propose a Multi-Indicator-Based Multi-Objective Evolutionary Algorithm (MI-MOEA) which categorizes all the solutions into different fronts. Specifically, the indicators are based on the popular <span>\\({\\mathbf{I}}_{{\\mathbf{SDE}}^{+}}\\)</span> indicator and make use of the minimum and median distance values among the different distances when the solutions with better Sum of Objectives (SOB) are projected. The use of these two <span>\\({\\mathbf{I}}_{{\\mathbf{SDE}}^{+}}\\)</span>-based indicator values features an efficient balance of exploration and exploitation. To evaluate the performance of the proposed MI-MOEA, Neural Architecture Search (NAS) which involves the design of appropriate architectures suitable for specific applications is employed. From an optimization perspective, NAS involves multiple conflicting objectives that needs to be simultaneously optimized. In this paper, we consider a recently proposed multi-objective NAS benchmark and favorably evaluate the performance of MI-MOEA compared to other state-of-the-art MOEAs.</p>","PeriodicalId":51327,"journal":{"name":"International Journal of Machine Learning and Cybernetics","volume":null,"pages":null},"PeriodicalIF":3.1000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Machine Learning and Cybernetics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s13042-024-02300-6","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

\({\mathbf{I}}_{{\mathbf{SDE}}^{+}}\) is proven to be one of the leading scalable indicator for evolutionary multi and many-objective optimization. However, it fails to segregate members of a given population beyond the first front as a large number of solutions in the population have identical \({\mathbf{I}}_{{\mathbf{SDE}}^{+}}\) values. This mainly affects the performance of the algorithm when handling optimization problems with lower objectives. Consequently, we hypothesize that the overall performance of the algorithm can be further improved by introducing a categorization mechanism similar to the categorization of Pareto Fronts (PFs) in dominance-based methods. Therefore, in this work, we propose a Multi-Indicator-Based Multi-Objective Evolutionary Algorithm (MI-MOEA) which categorizes all the solutions into different fronts. Specifically, the indicators are based on the popular \({\mathbf{I}}_{{\mathbf{SDE}}^{+}}\) indicator and make use of the minimum and median distance values among the different distances when the solutions with better Sum of Objectives (SOB) are projected. The use of these two \({\mathbf{I}}_{{\mathbf{SDE}}^{+}}\)-based indicator values features an efficient balance of exploration and exploitation. To evaluate the performance of the proposed MI-MOEA, Neural Architecture Search (NAS) which involves the design of appropriate architectures suitable for specific applications is employed. From an optimization perspective, NAS involves multiple conflicting objectives that needs to be simultaneously optimized. In this paper, we consider a recently proposed multi-objective NAS benchmark and favorably evaluate the performance of MI-MOEA compared to other state-of-the-art MOEAs.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多指标的多目标进化算法在神经架构搜索中的应用
事实证明,\({\mathbf{I}}_{\mathbf{SDE}}^{+}}\)是进化多目标优化的主要可扩展指标之一。然而,由于种群中的大量解决方案具有相同的 \({\mathbf{I}}_{{mathbf{SDE}}^{+}}/)值,它无法将给定种群中的成员分离到第一前沿之外。这主要影响了算法在处理低目标优化问题时的性能。因此,我们假设,通过引入一种类似于基于优势的方法中帕累托前沿(PFs)分类机制,可以进一步提高算法的整体性能。因此,在这项工作中,我们提出了一种基于多指标的多目标进化算法(MI-MOEA),它将所有解决方案分为不同的前沿。具体来说,这些指标是基于流行的 \({\mathbf{I}}_{{math\bf{SDE}}^{+}}\) 指标,并利用不同距离中的最小距离值和中位距离值来预测目标总和(SOB)较好的解决方案。使用这两个基于指标值的({\mathbf{I}}_{\mathbf{SDE}}^{+}}/)可以有效平衡探索和利用。为了评估所提出的 MI-MOEA 的性能,我们采用了神经架构搜索(NAS),其中包括设计适合特定应用的适当架构。从优化的角度来看,NAS 涉及需要同时优化的多个相互冲突的目标。在本文中,我们考虑了最近提出的多目标 NAS 基准,并与其他最先进的 MOEA 相比,对 MI-MOEA 的性能进行了有利的评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Machine Learning and Cybernetics
International Journal of Machine Learning and Cybernetics COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
7.90
自引率
10.70%
发文量
225
期刊介绍: Cybernetics is concerned with describing complex interactions and interrelationships between systems which are omnipresent in our daily life. Machine Learning discovers fundamental functional relationships between variables and ensembles of variables in systems. The merging of the disciplines of Machine Learning and Cybernetics is aimed at the discovery of various forms of interaction between systems through diverse mechanisms of learning from data. The International Journal of Machine Learning and Cybernetics (IJMLC) focuses on the key research problems emerging at the junction of machine learning and cybernetics and serves as a broad forum for rapid dissemination of the latest advancements in the area. The emphasis of IJMLC is on the hybrid development of machine learning and cybernetics schemes inspired by different contributing disciplines such as engineering, mathematics, cognitive sciences, and applications. New ideas, design alternatives, implementations and case studies pertaining to all the aspects of machine learning and cybernetics fall within the scope of the IJMLC. Key research areas to be covered by the journal include: Machine Learning for modeling interactions between systems Pattern Recognition technology to support discovery of system-environment interaction Control of system-environment interactions Biochemical interaction in biological and biologically-inspired systems Learning for improvement of communication schemes between systems
期刊最新文献
LSSMSD: defending against black-box DNN model stealing based on localized stochastic sensitivity CHNSCDA: circRNA-disease association prediction based on strongly correlated heterogeneous neighbor sampling Contextual feature fusion and refinement network for camouflaged object detection Scnet: shape-aware convolution with KFNN for point clouds completion Self-refined variational transformer for image-conditioned layout generation
×
引用
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