Bridge the gap between fixed-length and variable-length evolutionary neural architecture search algorithms

被引:0
|
作者
Gong, Yunhong [1 ]
Sun, Yanan [1 ]
Peng, Dezhong [1 ,2 ]
Chen, Xiangru [1 ]
机构
[1] Sichuan Univ, Coll Comp Sci, Chengdu 610065, Peoples R China
[2] Natl Innovat Ctr UHD Video Technol, Chengdu 610095, Peoples R China
来源
ELECTRONIC RESEARCH ARCHIVE | 2024年 / 32卷 / 01期
基金
中国国家自然科学基金;
关键词
neural architecture search; evolutionary algorithm; variable-length encoding; fixed-length encoding; autoencoder; NETWORKS; OPTIMIZATION; AUTOENCODER;
D O I
10.3934/era.2024013
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Evolutionary neural architecture search (ENAS) aims to automate the architecture design of deep neural networks (DNNs). In recent years, various ENAS algorithms have been proposed, and their effectiveness has been demonstrated. In practice, most ENAS methods based on genetic algorithms (GAs) use fixed-length encoding strategies because the generated chromosomes can be directly processed by the standard genetic operators (especially the crossover operator). However, the performance of existing ENAS methods with fixed-length encoding strategies can also be improved because the optimal depth is regarded as a known priori. Although variable-length encoding strategies may alleviate this issue, the standard genetic operators are replaced by the developed operators. In this paper, we proposed a framework to bridge this gap and to improve the performance of existing ENAS methods based on GAs. First, the fixed-length chromosomes were transformed into variable-length chromosomes with the encoding rules of the original ENAS methods. Second, an encoder was proposed to encode variable-length chromosomes into fixed-length representations that can be efficiently processed by standard genetic operators. Third, a decoder cotrained with the encoder was adopted to decode those processed high-dimensional representations which cannot directly describe architectures into original chromosomal forms. Overall, the performances of existing ENAS methods with fixed-length encoding strategies and variable-length encoding strategies have both improved by the proposed framework, and the effectiveness of the framework was justified through experimental results. Moreover, ablation experiments were performed and the results showed that the proposed framework does not negatively affect the original ENAS methods.
引用
收藏
页码:263 / 292
页数:30
相关论文
共 50 条
  • [1] TEXT COMPRESSION USING VARIABLE-LENGTH TO FIXED-LENGTH ENCODINGS
    COOPER, D
    LYNCH, MF
    JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE, 1982, 33 (01): : 18 - 31
  • [2] Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs
    Cook, Debra L.
    Yung, Moti
    Keromytis, Angelos
    INFORMATION SECURITY AND CRYPTOLOGY, 2009, 5487 : 157 - +
  • [3] Class of easily implementable fixed-length to variable-length balanced binary line codes
    da Rocha, V. C.
    de Lemos-Neto, J. S.
    Pacheco, A. F.
    ELECTRONICS LETTERS, 2019, 55 (05) : 266 - 267
  • [4] VARIABLE-LENGTH VERSUS FIXED-LENGTH CODING: ON TRADEOFFS FOR SOFT-DECISION DECODING
    Han, Sai
    Fingscheidt, Tim
    2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [5] Codec design for variable-length to fixed-length data conversion for H.263
    Wang, Chua-Chin
    Sung, Gang-Neng
    Li, Jia-Hao
    IIH-MSP: 2006 INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PROCEEDINGS, 2006, : 483 - +
  • [6] Subdividing Long-Running, Variable-Length Analyses Into Short, Fixed-Length BOINC Workunits
    Adam L. Bazinet
    Michael P. Cummings
    Journal of Grid Computing, 2016, 14 : 429 - 441
  • [7] Subdividing Long-Running, Variable-Length Analyses Into Short, Fixed-Length BOINC Workunits
    Bazinet, Adam L.
    Cummings, Michael P.
    JOURNAL OF GRID COMPUTING, 2016, 14 (03) : 429 - 441
  • [9] Fixed-length switching vs. variable-length switching in input-queued IP switches
    Hu, CC
    Chen, XF
    Li, WJ
    Liu, B
    2004 IEEE WORKSHOP ON IP OPERATIONS AND MANAGEMENT PROCEEDINGS (IPOM 2004): SELF-MEASUREMENT & SELF-MANAGEMENT OF IP NETWORKS & SERVICES, 2004, : 117 - 122
  • [10] A novel selection mechanism for evolutionary algorithms with metameric variable-length representations
    Ryerkerk, Matt
    Averill, Ron
    Deb, Kalyanmoy
    Goodman, Erik
    SOFT COMPUTING, 2020, 24 (21) : 16439 - 16452