This study investigates the optimization of ES-HyperNEAT hyperparameters using the Tree-structured Parzen Estimator (TPE) on the MNIST classification task, exploring a search space of over 3 billion potential combinations and provides insights into the hyperparameters' transferability across tasks of varying complexity.
Abstract
Neuroevolution of Augmenting Topologies (NEAT) and its advanced version, Evolvable-Substrate HyperNEAT (ES-HyperNEAT), have shown great potential in developing neural networks. However, their effectiveness heavily depends on the selection of hyperparameters. This study investigates the optimization of ES-HyperNEAT hyperparameters using the Tree-structured Parzen Estimator (TPE) on the MNIST classification task, exploring a search space of over 3 billion potential combinations. TPE effectively navigates this vast space, significantly outperforming random search in terms of mean, median, and best accuracy. During the validation process, the best hyperparameter configuration found by TPE achieves an accuracy of 29.00% on MNIST, surpassing previous studies while using a smaller population size and fewer generations. The transferability of the optimized hyperparameters is explored in logic operations and Fashion-MNIST tasks, revealing successful transfer to the more complex Fashion-MNIST problem but limited to simpler logic operations. This study emphasizes a method to unlock the full potential of neuroevolutionary algorithms and provides insights into the hyperparameters' transferability across tasks of varying complexity.
Most hyperparameter configurations for Evolvable-Substrate HyperNEAT (ES-HyperNEAT) produce networks that stagnate at random-guessing performance, wasting computational resources. We frame early stopping as binary classification on early fitness trajectories: for each trial, we compute the cumulative median of best-per...
Romain Claret, Arthur Gygax, Michael O'Neill et al.· 2 citations· ⚡1
A comparative analysis of two metaheuristic algorithms — Particle Swarm Optimization and Dwarf Mongoose Optimization — as advanced alternatives for hyperparameter tuning in deep learning models trained on the CIFAR-10 dataset reinforces the potential of metaheuristic-based optimization as a robust framework for hyperpa...
Zulfahmi Syahputra, R. F. Rahmat· JITK (Jurnal Ilmu Pengetahua...· 0 citations
It is demonstrated that hyperparameter optimization dynamics depend heavily on dataset complexity, where computational efficiency is the primary differentiator for simpler classification tasks, but optimization architecture selection becomes critical for navigating challenging medical imaging applications.
Sarab Almuhaideb, Ahmad Raza Khan· Applied Sciences· 0 citations
These findings define the structural constraints any substrate-discovery method must satisfy to scale coordinate-based neuroevolution; the companion EMR-HyperNEAT reformulation, which replaces adaptive subdivision with eager evaluation of a static multi-resolution grid, satisfies them and resolves the bottleneck this p...
Romain Claret, Michael O'Neill, Paul Cotofrei et al.· 0 citations
Four evolutionary optimization algorithms and six activation functions are investigated, resulting in 24 different configurations, and their performance on the Inverted Double Pendulum environment is evaluated, where one algorithm consistently exhibits stable learning across most activation functions.
Hesham Magdy, Amany M. Sarhan, E. Sallam et al.· Journal of Electrical System...· 0 citations
An improved multi-operator differential evolution algorithm, called NN-IMODE, tailored for comprehensive Feedforward Neural Networks optimization, encompassing the number of hidden layers, neurons per layer, weights, biases, and activation functions, is introduced.
Aridj Ferhat, Farouq Zitouni, Karam M. Sallam et al.· Cluster Computing· 0 citations