计算机科学
适应性突变
突变
人口
进化算法
因子(编程语言)
公制(单位)
人工智能
数学优化
过程(计算)
遗传算法
机器学习
数学
工程类
生物化学
操作系统
化学
运营管理
人口学
社会学
基因
程序设计语言
作者
Bin Cao,Z.X. Zhou,Xin Liu,M. Shamim Hossain,Zhihan Lv
标识
DOI:10.1145/3606042.3616463
摘要
The automated design of generative adversarial networks (GAN) is currently being solved well by neural architecture search (NAS), although there are still some issues. One problem is the vast majority of NAS for GANs methods are only based on a single evaluation metric or a linear superposition of multiple evaluation metrics. Another problem is that the conventional evolutionary neural architecture search (ENAS) is unable to adjust its mutation probabilities in accordance with the NAS process, making it simple to settle into a local optimum. To address these issues, we firstly design a two-factor cooperative mutation mechanism that can control the mutation probability based on the current iteration rounds of the population, population fitness and other information. Secondly, we divide the evolutionary process into three stages based on the properties of NAS, so that the different stages can adaptively adjust the mutation probability according to the population state and the expected development goals. Finally, we incorporate multiple optimization objectives from GANs based on image generation tasks into ENAS. And we construct an adaptive multiobjective ENAS based on a two-factor cooperative mutation mechanism. We test and ablate our algorithm on the STL-10 and CIFAR-10 datasets, and the experimental results show that our method outperforms the majority of traditional NAS-GANs.
科研通智能强力驱动
Strongly Powered by AbleSci AI