Comparing Expected Improvement and Kriging Believer for Expensive Bilevel Optimization

被引:4
作者
Wang, Bing [1 ]
Singh, Hemant Kumar [1 ]
Ray, Tapabrata [1 ]
机构
[1] Univ New South Wales, Canberra, ACT, Australia
来源
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021) | 2021年
基金
澳大利亚研究理事会;
关键词
Expensive bilevel optimization; surrogate modeling; evolutionary algorithm; EFFICIENT GLOBAL OPTIMIZATION; ALGORITHM;
D O I
10.1109/CEC45853.2021.9504815
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Bilevel optimization refers to a specialized class of problems where one optimization task is nested as a constraint within another. Such problems emerge in a range of real-world scenarios involving hierarchical decision-making, and significant literature exists on classical and evolutionary approaches to solve them. However, computationally expensive bilevel optimization problems remain relatively less explored. Since each evaluation incurs a significant computational cost, one can only perform a limited number of function evaluations during the course of search. Surrogate-assisted strategies provide a promising way forward to deal with such classes of problems. Of particular interest to this study are the steady-state strategies which carefully pre-select a promising solution for true evaluation based on a surrogate model. The main aim of this paper is to compare two widely adopted steady-state infill strategies - Kriging believer (KB) and expected improvement (EI) - through systematic experiments within a nested optimization framework. Our experiments on a set of benchmark problems reveal some interesting and counter-intuitive observations. We discuss some of the underlying reasons and believe that the findings will inform further research on understanding and improving search strategies for expensive bilevel optimization.
引用
收藏
页码:1635 / 1642
页数:8
相关论文
共 30 条
[1]   Performance Evaluation of Local Surrogate Models in Bilevel Optimization [J].
Angelo, Jaqueline S. ;
Krempser, Eduardo ;
Barbosa, Helio J. C. .
MACHINE LEARNING, OPTIMIZATION, AND DATA SCIENCE, 2019, 11943 :347-359
[2]  
Angelo JS, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P1784, DOI 10.1109/CEC.2014.6900529
[3]  
Angelo JS, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P470
[4]   Constraint Handling in Efficient Global Optimization [J].
Bagheri, Samineh ;
Konen, Wolfgang ;
Allmendinger, Richard ;
Branke, Jurgen ;
Deb, Kalyanmoy ;
Fieldsend, Jonathan ;
Quagliarella, Domenico ;
Sindhya, Karthik .
PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, :673-680
[5]  
Bischl B., 2014, INT C LEARN INT OPT, P173, DOI [10.1007/978-3-319-09584-417, 10.1007/978-3-319-09584-4_17]
[6]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[7]  
Forrester A., 2008, ENG DESIGN VIA SURRO
[8]  
Han G., MATLAB PARAMETRIC EM
[9]   A Framework for Scalable Bilevel Optimization: Identifying and Utilizing the Interactions Between Upper-Level and Lower-Level Variables [J].
Huang, Pei-Qiu ;
Wang, Yong .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (06) :1150-1163
[10]  
Islam Md Monjurul, 2017, AI 2017: Advances in Artificial Intelligence. 30th Australasian Joint Conference. Proceedings: LNAI 10400, P106, DOI 10.1007/978-3-319-63004-5_9