An Adaptive Neuro-Metaheuristic Framework Integrating Transformer-Based Surrogate Modeling with Differential Evolution for High-Dimensional Black-Box Optimization
Sep 2026· Neutrosophic Optimization and Intelligent Systems· Vol 11, pp. 70-82· 1 citation
TL;DR
The Adaptive Neuro-Metaheuristic with Transformer-based Transformer-based Differential Evolution (ANM-TDE), which combines a Transformer-based surrogate model with a self-adaptive Differential Evolution (DE) algorithm to greatly reduce the number of real function evaluations while maintaining a strong global search performance.
Abstract
High-dimensional black-box optimization is a highly challenging problem, especially when each function evaluation is expensive, the objective is non-differentiable, and we know almost nothing about its structure. In this case, traditional gradient-based methods are not available, and most existing metaheuristics either stagnate far away from the truly competitive solutions or require an impractically large number of evaluations once the dimension goes beyond about d=100. This paper directly addresses this challenge, and we propose the Adaptive Neuro-Metaheuristic with Transformer-based Differential Evolution (ANM-TDE), which combines a Transformer-based surrogate model with a self-adaptive Differential Evolution (DE) algorithm to greatly reduce the number of real function evaluations while maintaining a strong global search performance. The surrogate model is incrementally trained on all previously evaluated candidates, and uses multi-head self-attention to predict the fitness of candidates, while the DE engine consults the surrogate to pre-screen the trial solutions before paying the cost of real evaluations. We prove that the expected difference between the surrogate-predicted fitness and the true fitness converges with rate O(N^{-1/2}) as the size N of the archive increases, and that the overall method converges to a stationary point with rate O(1/K) in the nonconvex setting, assuming an L smooth bound on the surrogate model’s approximation error. On 12 benchmark problems with dimensions from d=30 to d=500, including Sphere, Rosenbrock, Rastrigin, Ackley, Schwefel, and Levy, ANM-TDE reduces the number of real function evaluations by 67-73% compared with standard DE, while achieving a mean best fitness of 1.47 x 10^{-12} on F1 (Sphere, d=100), versus 8.93 x 10^{-8} for CMA-ES. Wilcoxon signed-rank tests are applied, and statistically significant improvements are reported on 10 out of 12 benchmarks. The results show that ANM TDE is a competitive algorithm for expensive black box optimization problems such as engineering design, hyperparameter tuning and scientific simulation.
Black-Box Optimization (BBO) is often applied in several engineering fields and can utilize an advancement of numerical measure- ments and simulation technologies. It deals with the optimization func- tions, where an analytical description is unavailable. It relies on meth- ods that require only an input point in the s...
M. I. Zim, Martin Holeňa Czech Academy of Sciences, Institute of Space Science et al.· 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.
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
Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Journal of Heuristics· 0 citations
Neural Architecture Search (NAS), often formulated as a bilevel optimization problem, presents significant challenges characterized by discrete search spaces and computationally expensive performance evaluations. Standard evolutionary metaheuristics frequently encounter difficulties in such landscapes due to ineffici...
Han-Jie Xu, Ji-Yuan Chen, Jun Tang et al.· International Journal of Com...· 0 citations
Although population-based metaheuristic algorithms have been widely applied to the One-Dimensional Cutting Stock Problem (1D-CSP), their performance is often limited by premature convergence and insufficient local search capability. This study presents a comparative investigation of the effect of local search on four p...
Gözde Alp, Fatih Soygazi, Yılmaz Kılıçaslan· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.