arrow
Return

Efficient Self-learning Evolutionary Neural Architecture Search

delete2023-10-01
delete7
delete
OA
AI
W
Wei Bi
D
Dong Xu
H
Hua Guo
葛宏伟 (Hongwei Ge)
梁艳春 (Yanchun Liang)
H
Heow Pueh Lee
C
Chunguo Wu *
DOI:10.1016/j.asoc.2023.110671delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The evolutionary algorithm has become a major method for neural architecture search recently. However, the fixed probability distribution employed by the traditional evolutionary algorithm may lead to structural complexity and redundancy due to its inability to control the size of individual architectures, and it cannot learn from empirical information gathered during the search process to guide the subsequent search more effectively and efficiently. Moreover, evaluating the performance of all the searched architectures requires significant computing resources and time overhead. To overcome these challenges, we present the Efficient Self-learning Evolutionary Neural Architecture Search (ESE-NAS) method. Firstly, we propose an Adaptive Learning Strategy for Mutation Sampling, composed of a Model Size Control module and a Credit Assignment method for Mutation Candidates, to guide the search process by learning from the model size information and evaluation results of the architectures and adjusting the probability distributions for evolution sampling accordingly. Additionally, we developed a neural architecture performance predictor to further improve the efficiency of NAS. Experiments on CIFAR-10 and CIFAR-100 datasets show that ESE-NAS significantly brings forward the first hitting time of the optimal architectures and reaches a competitive performance level with classic manual-designed and NAS models while maintaining structural simplicity and efficiency.& COPY; 2023 Published by Elsevier B.V.
Keywords:
Evolutionary algorithm
Neural architecture search
Probability distribution
Model size control
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

D
Dalian University of Technology
Scholars:
5.9W
Papers: 4.4W
Citations: 5.5W
University of Missouri System cover
University of Missouri System
Scholars:
2.9W
Papers: 2.7W
Citations: 75
N
National University of Singapore
Scholars:
7.5W
Papers: 6.5W
Citations: 11.4W
J
Jilin University
Scholars:
8.6W
Papers: 5.5W
Citations: 8.9K
researcher View more organizations