NeurGO: Learning to Generate Elite Candidates for Meta-Black-Box Expensive Optimization
Not on the map. Why?
Abstract (arXiv)
Expensive black-box optimization is ubiquitous in science and engineering, where function evaluations are costly and the evaluation budget is limited. Traditional evolutionary algorithms and Meta-BlackBox Optimization (MetaBBO) approaches typically consume most evaluations on candidate selection, often wasting precious budget on inferior solutions. Although surrogate-assisted evolution and Bayesian optimization aim to reduce evaluations through surrogate models, constructing an accurate global model from limited data remains challenging, and model bias can easily trap the search in local optima. To overcome these limitations, we propose NeurGO, a generative MetaBBO framework that directly synthesizes elite candidates from historical population states. Specifically, we employ an attention-based encoder to capture the population-level search trend and condition a decoder on this representation to generate high-quality candidates, avoiding the expensive evaluation of large offspring pools. We then design a quality-diversity loss to maintain solution quality and population diversity throughout the search. Through extensive benchmarking on CEC 2008 and the COCO BBOB test suites, our method achieves better optimization performance under the same evaluation budget and exhibits faster convergence.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 45 references that are in the map. First posted on arXiv 26 Jul 2026.
Builds on
22 of 45 references.
References · 22
- 2017Attention Is All You Needcited by 60,361
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
- 2016COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Settingcited by 138
- 2017Learned Optimizers that Scale and Generalizecited by 110
- 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 83
- 2022Recent Advances in Bayesian Optimizationcited by 76
- 2024Efficient Evolutionary Search Over Chemical Space with Large Language Modelscited by 61
- 2022Discovering Evolution Strategies via Meta-Black-Box Optimizationcited by 44
- 2022Automated Dynamic Algorithm Configurationcited by 39
- 2022Multi-agent Dynamic Algorithm Configurationcited by 36
- 2023MetaBox: A Benchmark Platform for Meta-Black-Box Optimization with Reinforcement Learningcited by 36
10 more
- 2023Discovering Attention-Based Genetic Algorithms via Meta-Black-Box Optimizationcited by 33
- 2024Toward Automated Algorithm Design: A Survey and Practical Guide to Meta-Black-Box-Optimizationcited by 24
- 2021Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problemscited by 20
- 2023B2Opt: Learning to Optimize Black-box Optimization with Little Budgetcited by 15
- 2024Reinforced In-Context Black-Box Optimizationcited by 14
- 2025MetaBox-v2: A Unified Benchmark Platform for Meta-Black-Box Optimizationcited by 9
- 2025Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEAcited by 5
- 2020Towards Automatic Bayesian Optimization: A first step involving acquisition functionscited by 2
- 2024Deep Neural Crossovercited by 2
- 2024Surrogate-Assisted Search with Competitive Knowledge Transfer for Expensive Optimizationcited by 2
Built on by
Not cited yet.