paper-with-me

Papers

Sampled Training and Node Inheritance for Fast Evolutionary Neural Architecture Search

2020-03-07 · Haoyu Zhang, Yaochu Jin, Ran Cheng, Kuangrong Hao

The performance of a deep neural network is heavily dependent on its architecture and various neural architecture search strategies have been developed for automated network architecture design. Recently, evolutionary neural architecture search (ENAS) has received increasing attention due to the attractive global optimization capability of evolutionary algorithms. However, ENAS suffers from extremely high computation costs because a large number of performance evaluations is usually required in evolutionary optimization and training deep neural networks is itself computationally very intensive. To address this issue, this paper proposes a new evolutionary framework for fast ENAS based on directed acyclic graph, in which parents are randomly sampled and trained on each mini-batch of training data. In addition, a node inheritance strategy is adopted to generate offspring individuals and their fitness is directly evaluated without training. To enhance the feature processing capability of the evolved neural networks, we also encode a channel attention mechanism in the search space. We evaluate the proposed algorithm on the widely used datasets, in comparison with 26 state-of-the-art peer algorithms. Our experimental results show the proposed algorithm is not only computationally much more efficiently, but also highly competitive in learning performance.

📄 PDF Abstract BibTeX arXiv:2003.11613

Code (0)

등록된 구현이 없습니다.

Tasks

Evolutionary Algorithmsglobal-optimizationNeural Architecture Search

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음
Tanh Activation 설명 없음
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…

Similar Papers 제목 키워드 기반

Epigenetic opportunities for Evolutionary Computation

2021-08-10 · Sizhe Yuen, Thomas H. G. Ezard, Adam J. Sobey

Evolutionary Computation is a group of biologically inspired algorithms used to solve complex optimisation problems. It can be split into Evolutionary Algorithms, which take inspiration from genetic inheritance, and Swar…

Evolutionary Algorithms

Supervising Unsupervised Learning with Evolutionary Algorithm in Deep Neural Network

2018-03-28 · Takeshi Inagaki

A method to control results of gradient descent unsupervised learning in a deep neural network by using evolutionary algorithm is proposed. To process crossover of unsupervisedly trained models, the algorithm evaluates p…

Document ClassificationGeneral Classification

Integrating Sample Inheritance into Bayesian Optimization for Evolutionary Robotics

2026-01-07 · K. Ege de Bruin, Kyrre Glette, Kai Olav Ellefsen arxiv

In evolutionary robotics, robot morphologies are designed automatically using evolutionary algorithms. This creates a body-brain optimization problem, where both morphology and control must be optimized together. A commo…

The Effect of Epigenetic Blocking on Dynamic Multi-Objective Optimisation Problems

2022-11-25 · Sizhe Yuen, Thomas H. G. Ezard, Adam J. Sobey

Hundreds of Evolutionary Computation approaches have been reported. From an evolutionary perspective they focus on two fundamental mechanisms: cultural inheritance in Swarm Intelligence and genetic inheritance in Evoluti…

BlockingEvolutionary Algorithms

Inferring phylogenetic networks with maximum pseudolikelihood under incomplete lineage sorting

2016-02-12

Phylogenetic networks are necessary to represent the tree of life expanded by edges to represent events such as horizontal gene transfers, hybridizations or gene flow. Not all species follow the paradigm of vertical inhe…