REVIEW 2 cited by
Toward Automated Algorithm Design: A Survey and Practical Guide to Meta-Black-Box-Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this survey, we introduce Meta-Black-Box-Optimization~(MetaBBO) as an emerging avenue within the Evolutionary Computation~(EC) community, which incorporates Meta-learning approaches to assist automated algorithm design. Despite the success of MetaBBO, the current literature provides insufficient summaries of its key aspects and lacks practical guidance for implementation. To bridge this gap, we offer a comprehensive review of recent advances in MetaBBO, providing an in-depth examination of its key developments. We begin with a unified definition of the MetaBBO paradigm, followed by a systematic taxonomy of various algorithm design tasks, including algorithm selection, algorithm configuration, solution manipulation, and algorithm generation. Further, we conceptually summarize different learning methodologies behind current MetaBBO works, including reinforcement learning, supervised learning, neuroevolution, and in-context learning with Large Language Models. A comprehensive evaluation of the latest representative MetaBBO methods is then carried out, alongside an experimental analysis of their optimization performance, computational efficiency, and generalization ability. Based on the evaluation results, we meticulously identify a set of core designs that enhance the generalization and learning effectiveness of MetaBBO. Finally, we outline the vision for the field by providing insight into the latest trends and potential future directions. Relevant literature will be continuously collected and updated at https://github.com/MetaEvo/Awesome-MetaBBO.
Forward citations
Cited by 2 Pith papers
-
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
The paper shows that a GNN-based RL controller that reads a graph of the current Pareto front can outperform static tuning and prior RL tuners on multi-objective scheduling problems.
-
ConfigX: Modular Configuration for Evolutionary Algorithms via Multitask Reinforcement Learning
A unified RL policy can configure modular evolutionary algorithms within a family, but the claimed universal zero-shot generalization across algorithm families is not supported.
Discussion (0). Continue with ORCID to comment.