Aug 2026· International Conference on Methods & Models in Automation & Robotics· pp. 536-541· 0 citations· 29 references
Abstract
Hyperparameter optimization (HPO) is a critical yet computationally intensive task in modern neural network design, particularly as model architectures and search spaces increase in complexity. Classical methods such as grid search and random search are often inefficient in high-dimensional spaces, while Bayesian optimization (BO) and evolutionary algorithms (EAs) each offer complementary strengths but also face limitations related to scalability, convergence, and the exploration-exploitation balance. To address these challenges, we propose BOinEA, a novel hybrid HPO method that tightly integrates probabilistic surrogate modeling from BO with the population-based search dynamics of EAs. Unlike existing hybrid approaches that rely on sequential switching or loosely coupled components, BOinEA maintains continuous coordination between global exploration and local exploitation throughout the optimization process. We evaluate BOinEA on benchmark datasets, including CIFAR-10, Fashion-MNIST, and NSL-KDD, and compare it with established HPO techniques such as BOGP, SMAC, and standalone EAs. Experimental results show that BOinEA achieves the best test accuracy on CIFAR-10 and competitive performance on Fashion-MNIST and NSL-KDD, suggesting a favorable trade-off between accuracy, sample efficiency, and convergence speed. These findings suggest that BOinEA provides a robust and scalable framework for neural network hyperparameter optimization and contributes to ongoing advances in automated machine learning.
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
A unified framework, KENDO (Kernel ENsemble Disagreement-aware Operator), is proposed that integrates Ensemble Gaussian Processes (EGP) with disagreement-aware acquisition strategies and extends the approach to multi-objective optimization via random scalarization that preserves the single-optimizer conditioning struct...
Heng Zhang, Hao-Tian Xiang, Konstantinos D. Polyzos et al.· 1 citation
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
This paper presents an improved genetic algorithm (GenAlg) for hyperparameter optimization in predictive modelling. It addresses common limitations of traditional genetic algorithms (GAs), including slow convergence, high computational cost, and premature convergence. The proposed method incorporates early stopping, fl...
Dmitriy Kravtsov, Nikolay Poletaev· International Scientific Jou...· 0 citations
Compared with the state-of-the-art algorithms for HEPs, AEO shows extraordinarily high efficiency for these challenging problems while SAEO can greatly improve the performance of AEO in most cases, thus opening new directions for various swarm optimization and evolutionary algorithms under both AEO and SAEO.
Global optimization has become a cornerstone of modern machine learning, particularly for the challenging task of training high-dimensional neural network architectures. Despite the prevalence of established metaheuristics, traditional approaches frequently struggle with the irregular and multimodal error surfaces inhe...
K. Barkas, Ioannis G. Tsoulos, Vasileios Charilogis et al.· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.