OPAL: 用于景观感知的黑盒优化运算符-程序算法
OPAL: Operator-Programmed Algorithms for Landscape-Aware Black-Box Optimization
AI总结:
OPAL通过运算符程序化和景观感知的方法,实现了在黑盒优化中的高效优化,优于传统方法。
摘要:
黑盒优化往往依赖于进化和群体算法,其性能高度依赖于具体问题。我们将优化器视为一个短程序,该程序基于少量的搜索运算符词汇进行构建,并为每个问题实例分别学习这个运算符程序。我们在此基础上提出了Operator-Programmed Algorithms(OPAL),这是一种用于连续黑盒优化的景观感知框架,它使用较小的设计预算,通过标准差分进化基线来探测景观,构建采样点的k-最近邻图,并将此轨迹编码为图神经网络。随后,一个元学习器将得到的表示映射到一个分阶段的探索、重启和局部搜索运算符调度方案。在CEC~2017测试套件上,一个单一的元训练OPAL策略在统计上与最先进的自适应差分进化变体具有竞争力,并在非参数测试中显著优于更简单的基线。对CEC~2017的消融研究验证了设计阶段、轨迹图和运算符程序表示的选择,而元组件仅带来微小的运行时间开销。总体而言,结果表明,运算符程序化的、景观感知的实例设计是黑盒优化领域超越随意隐喻算法的一种可行方法。
英文摘要:
Black-box optimization often relies on evolutionary and swarm algorithms whose performance is highly problem dependent. We view an optimizer as a short program over a small vocabulary of search operators and learn this operator program separately for each problem instance. We instantiate this idea in Operator-Programmed Algorithms (OPAL), a landscape-aware framework for continuous black-box optimization that uses a small design budget with a standard differential evolution baseline to probe the landscape, builds a $k$-nearest neighbor graph over sampled points, and encodes this trajectory with a graph neural network. A meta-learner then maps the resulting representation to a phase-wise schedule of exploration, restart, and local search operators. On the CEC~2017 test suite, a single meta-trained OPAL policy is statistically competitive with state-of-the-art adaptive differential evolution variants and achieves significant improvements over simpler baselines under nonparametric tests. Ablation studies on CEC~2017 justify the choices for the design phase, the trajectory graph, and the operator-program representation, while the meta-components add only modest wall-clock overhead. Overall, the results indicate that operator-programmed, landscape-aware per-instance design is a practical way forward beyond ad hoc metaphor-based algorithms in black-box optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。