Towards Dynamic Algorithm Selection for Numerical Black-Box Optimization: Investigating BBOB as a Use Case

被引:9
|
作者
Vermetten, Diederick [1 ]
Wang, Hao [2 ]
Back, Thomas [1 ]
Doerr, Carola [2 ]
机构
[1] Leiden Inst Adv Comp Sci, Leiden, Netherlands
[2] Sorbonne Univ, CNRS, LIP6, Paris, France
来源
GECCO'20: PROCEEDINGS OF THE 2020 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE | 2020年
关键词
D O I
10.1145/3377930.3390189
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the most challenging problems in evolutionary computation is to select from its family of diverse solvers one that performs well on a given problem. This algorithm selection problem is complicated by the fact that different phases of the optimization process require different search behavior. While this can partly be controlled by the algorithm itself, there exist large differences between algorithm performance. It can therefore be beneficial to swap the configuration or even the entire algorithm during the run. Long deemed impractical, recent advances in Machine Learning and in exploratory landscape analysis give hope that this dynamic algorithm configuration (dynAC) can eventually be solved by automatically trained configuration schedules. With this work we aim at promoting research on dynAC, by introducing a simpler variant that focuses only on switching between different algorithms, not configurations. Using the rich data from the Black Box Optimization Benchmark (BBOB) platform, we show that even single-switch dynamic Algorithm selection (dynAS) can potentially result in significant performance gains. We also discuss key challenges in dynAS, and argue that the BBOB-framework can become a useful tool in overcoming these.
引用
收藏
页码:654 / 662
页数:9
相关论文
共 50 条
  • [21] Template based black-box optimization of dynamic neural fields
    Fix, Jeremy
    NEURAL NETWORKS, 2013, 46 : 40 - 49
  • [22] NeuralBO: A black-box optimization algorithm using deep neural networks
    Dat, Phan-Trong
    Hung, Tran-The
    Gupta, Sunil
    NEUROCOMPUTING, 2023, 559
  • [23] An Evolutionary Algorithm for Black-Box Chance-Constrained Function Optimization
    Masutomi, Kazuyuki
    Nagata, Yuichi
    Ono, Isao
    JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2013, 17 (02) : 272 - 282
  • [24] A Two-Phase Global Optimization Algorithm for Black-Box Functions
    Gimbutiene, Grazina
    Zilinskas, Antanas
    BALTIC JOURNAL OF MODERN COMPUTING, 2015, 3 (03): : 214 - 224
  • [25] SCR, an efficient global optimization algorithm for constrained black-box problems
    Zaryab, Syed Ali
    Manno, Andrea
    Martelli, Emanuele
    OPTIMIZATION AND ENGINEERING, 2025,
  • [26] Adaptive sampling Bayesian algorithm for constrained black-box optimization problems
    Fan, Shuyuan
    Hong, Xiaodong
    Liao, Zuwei
    Ren, Congjing
    Yang, Yao
    Wang, Jingdai
    Yang, Yongrong
    AICHE JOURNAL, 2025, 71 (04)
  • [27] Test case selection for black-box regression testing of database applications
    Rogstad, Erik
    Briand, Lionel
    Torkar, Richard
    INFORMATION AND SOFTWARE TECHNOLOGY, 2013, 55 (10) : 1781 - 1795
  • [28] QCforever: A Quantum Chemistry Wrapper for Everyone to Use in Black-Box Optimization
    Sumita, Masato
    Terayama, Kei
    Tamura, Ryo
    Tsuda, Koji
    JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2022, 62 (18) : 4427 - 4434
  • [29] Towards improved benchmarking of black-box optimization algorithms using clustering problems
    Marcus Gallagher
    Soft Computing, 2016, 20 : 3835 - 3849
  • [30] Towards improved benchmarking of black-box optimization algorithms using clustering problems
    Gallagher, Marcus
    SOFT COMPUTING, 2016, 20 (10) : 3835 - 3849