English

Task-free Adaptive Meta Black-box Optimization

Neural and Evolutionary Computing 2026-02-10 v2 Artificial Intelligence Machine Learning

Abstract

Handcrafted optimizers become prohibitively inefficient for complex black-box optimization (BBO) tasks. MetaBBO addresses this challenge by meta-learning to automatically configure optimizers for low-level BBO tasks, thereby eliminating heuristic dependencies. However, existing methods typically require extensive handcrafted training tasks to learn meta-strategies that generalize to target tasks, which poses a critical limitation for realistic applications with unknown task distributions. To overcome the issue, we propose the Adaptive meta Black-box Optimization Model (ABOM), which performs online parameter adaptation using solely optimization data from the target task, obviating the need for predefined task distributions. Unlike conventional metaBBO frameworks that decouple meta-training and optimization phases, ABOM introduces a closed-loop adaptive parameter learning mechanism, where parameterized evolutionary operators continuously self-update by leveraging generated populations during optimization. This paradigm shift enables zero-shot optimization: ABOM achieves competitive performance on synthetic BBO benchmarks and realistic unmanned aerial vehicle path planning problems without any handcrafted training tasks. Visualization studies reveal that parameterized evolutionary operators exhibit statistically significant search patterns, including natural selection and genetic recombination.

Keywords

Cite

@article{arxiv.2601.21475,
  title  = {Task-free Adaptive Meta Black-box Optimization},
  author = {Chao Wang and Licheng Jiao and Lingling Li and Jiaxuan Zhao and Guanchun Wang and Fang Liu and Shuyuan Yang},
  journal= {arXiv preprint arXiv:2601.21475},
  year   = {2026}
}

Comments

This article was published as a conference paper (oral) at ICLR 2026

R2 v1 2026-07-01T09:25:22.308Z