Distribution of the search of evolutionary product unit neural networks for classification
원문 초록
This paper deals with the distributed processing in the search for an optimum classification model using evolutionary product unit neural networks. For this distributed search we used a cluster of computers. Our objective is to obtain a more efficient design than those net architectures which do not use a distributed process and which thus result in simpler designs. In order to get the best classification models we use evolutionary algorithms to train and design neural networks, which require a very time consuming computation. The reasons behind the need for this distribution are various. It is complicated to train this type of nets because of the difficulty entailed in determining their architecture due to the complex error surface. On the other hand, the use of evolutionary algorithms involves running a great number of tests with different seeds and parameters, thus resulting in a high computational cost
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
Benchmarking MOEAs for solving continuous multi-objective RL problems
Mergenetic: a Simple Evolutionary Model Merging Library
Evolutionary thoughts: integration of large language models and evolutionary algorithms
RainbowPlus: Enhancing Adversarial Prompt Generation via Evolutionary Quality-Diversity Search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.