采用多群体机制的成对比较关系辅助多目标进化神经架构搜索法

Yu Xue, Chenchen Zhu, MengChu Zhou, Mohamed Wahib, Moncef Gabbouj
{"title":"采用多群体机制的成对比较关系辅助多目标进化神经架构搜索法","authors":"Yu Xue, Chenchen Zhu, MengChu Zhou, Mohamed Wahib, Moncef Gabbouj","doi":"arxiv-2407.15600","DOIUrl":null,"url":null,"abstract":"Neural architecture search (NAS) enables re-searchers to automatically\nexplore vast search spaces and find efficient neural networks. But NAS suffers\nfrom a key bottleneck, i.e., numerous architectures need to be evaluated during\nthe search process, which requires a lot of computing resources and time. In\norder to improve the efficiency of NAS, a series of methods have been proposed\nto reduce the evaluation time of neural architectures. However, they are not\nefficient enough and still only focus on the accuracy of architectures. In\naddition to the classification accuracy, more efficient and smaller network\narchitectures are required in real-world applications. To address the above\nproblems, we propose the SMEM-NAS, a pairwise com-parison relation-assisted\nmulti-objective evolutionary algorithm based on a multi-population mechanism.\nIn the SMEM-NAS, a surrogate model is constructed based on pairwise compari-son\nrelations to predict the accuracy ranking of architectures, rather than the\nabsolute accuracy. Moreover, two populations cooperate with each other in the\nsearch process, i.e., a main population guides the evolution, while a vice\npopulation expands the diversity. Our method aims to provide high-performance\nmodels that take into account multiple optimization objectives. We conduct a\nseries of experiments on the CIFAR-10, CIFAR-100 and ImageNet datasets to\nverify its effectiveness. With only a single GPU searching for 0.17 days,\ncompetitive architectures can be found by SMEM-NAS which achieves 78.91%\naccuracy with the MAdds of 570M on the ImageNet. This work makes a significant\nadvance in the important field of NAS.","PeriodicalId":501347,"journal":{"name":"arXiv - CS - Neural and Evolutionary Computing","volume":"62 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Pairwise Comparison Relation-assisted Multi-objective Evolutionary Neural Architecture Search Method with Multi-population Mechanism\",\"authors\":\"Yu Xue, Chenchen Zhu, MengChu Zhou, Mohamed Wahib, Moncef Gabbouj\",\"doi\":\"arxiv-2407.15600\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Neural architecture search (NAS) enables re-searchers to automatically\\nexplore vast search spaces and find efficient neural networks. But NAS suffers\\nfrom a key bottleneck, i.e., numerous architectures need to be evaluated during\\nthe search process, which requires a lot of computing resources and time. In\\norder to improve the efficiency of NAS, a series of methods have been proposed\\nto reduce the evaluation time of neural architectures. However, they are not\\nefficient enough and still only focus on the accuracy of architectures. In\\naddition to the classification accuracy, more efficient and smaller network\\narchitectures are required in real-world applications. To address the above\\nproblems, we propose the SMEM-NAS, a pairwise com-parison relation-assisted\\nmulti-objective evolutionary algorithm based on a multi-population mechanism.\\nIn the SMEM-NAS, a surrogate model is constructed based on pairwise compari-son\\nrelations to predict the accuracy ranking of architectures, rather than the\\nabsolute accuracy. Moreover, two populations cooperate with each other in the\\nsearch process, i.e., a main population guides the evolution, while a vice\\npopulation expands the diversity. Our method aims to provide high-performance\\nmodels that take into account multiple optimization objectives. We conduct a\\nseries of experiments on the CIFAR-10, CIFAR-100 and ImageNet datasets to\\nverify its effectiveness. With only a single GPU searching for 0.17 days,\\ncompetitive architectures can be found by SMEM-NAS which achieves 78.91%\\naccuracy with the MAdds of 570M on the ImageNet. This work makes a significant\\nadvance in the important field of NAS.\",\"PeriodicalId\":501347,\"journal\":{\"name\":\"arXiv - CS - Neural and Evolutionary Computing\",\"volume\":\"62 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Neural and Evolutionary Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.15600\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Neural and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.15600","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

神经架构搜索(NAS)使再研究人员能够自动探索广阔的搜索空间,找到高效的神经网络。但是,NAS 存在一个关键瓶颈,即在搜索过程中需要对大量架构进行评估,这需要大量的计算资源和时间。为了提高 NAS 的效率,人们提出了一系列方法来减少神经架构的评估时间。然而,这些方法不够充分,仍然只关注架构的准确性。在实际应用中,除了分类准确性之外,还需要更高效、更小巧的网络架构。为了解决上述问题,我们提出了基于多种群机制的成对比较关系辅助多目标进化算法 SMEM-NAS。在 SMEM-NAS 中,我们根据成对比较关系构建了一个代用模型来预测架构的准确度排名,而不是绝对准确度。此外,在这些进化过程中,两个种群相互合作,即主种群引导进化,而副种群扩大多样性。我们的方法旨在提供兼顾多重优化目标的高性能模型。我们在 CIFAR-10、CIFAR-100 和 ImageNet 数据集上进行了一系列实验,以验证其有效性。SMEM-NAS 只需单个 GPU 搜索 0.17 天,就能找到有竞争力的架构,在 ImageNet 数据集上实现了 78.91% 的准确率,MAdds 为 570M。这项工作在 NAS 这一重要领域取得了重大进展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Pairwise Comparison Relation-assisted Multi-objective Evolutionary Neural Architecture Search Method with Multi-population Mechanism
Neural architecture search (NAS) enables re-searchers to automatically explore vast search spaces and find efficient neural networks. But NAS suffers from a key bottleneck, i.e., numerous architectures need to be evaluated during the search process, which requires a lot of computing resources and time. In order to improve the efficiency of NAS, a series of methods have been proposed to reduce the evaluation time of neural architectures. However, they are not efficient enough and still only focus on the accuracy of architectures. In addition to the classification accuracy, more efficient and smaller network architectures are required in real-world applications. To address the above problems, we propose the SMEM-NAS, a pairwise com-parison relation-assisted multi-objective evolutionary algorithm based on a multi-population mechanism. In the SMEM-NAS, a surrogate model is constructed based on pairwise compari-son relations to predict the accuracy ranking of architectures, rather than the absolute accuracy. Moreover, two populations cooperate with each other in the search process, i.e., a main population guides the evolution, while a vice population expands the diversity. Our method aims to provide high-performance models that take into account multiple optimization objectives. We conduct a series of experiments on the CIFAR-10, CIFAR-100 and ImageNet datasets to verify its effectiveness. With only a single GPU searching for 0.17 days, competitive architectures can be found by SMEM-NAS which achieves 78.91% accuracy with the MAdds of 570M on the ImageNet. This work makes a significant advance in the important field of NAS.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hardware-Friendly Implementation of Physical Reservoir Computing with CMOS-based Time-domain Analog Spiking Neurons Self-Contrastive Forward-Forward Algorithm Bio-Inspired Mamba: Temporal Locality and Bioplausible Learning in Selective State Space Models PReLU: Yet Another Single-Layer Solution to the XOR Problem Inferno: An Extensible Framework for Spiking Neural Networks
×
引用
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