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 条
[21]   Using Karush-Kuhn-Tucker proximity measure for solving bilevel optimization problems [J].
Sinha, Ankur ;
Soun, Tharo ;
Deb, Kalyanmoy .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 :496-510
[22]   Bilevel Optimization based on Kriging Approximations of Lower Level Optimal Value Function [J].
Sinha, Ankur ;
Bedi, Samish ;
Deb, Kalyanmoy .
2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, :213-220
[23]   A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications [J].
Sinha, Ankur ;
Malo, Pekka ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (02) :276-295
[24]   Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping [J].
Sinha, Ankur ;
Malo, Pekka ;
Deb, Kalyanmoy .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (02) :395-411
[25]   Test Problem Construction for Single-Objective Bilevel Optimization [J].
Sinha, Ankur ;
Malo, Pekka ;
Deb, Kalyanmoy .
EVOLUTIONARY COMPUTATION, 2014, 22 (03) :439-477
[26]   Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces [J].
Storn, R ;
Price, K .
JOURNAL OF GLOBAL OPTIMIZATION, 1997, 11 (04) :341-359
[27]  
Surjanovic S., 2013, Virtual Library of Simulation Experiments: Test Functions and Datasets
[28]  
Talbi E.G., 2013, Metaheuristics for Bilevel Optimization, P1
[29]   BILEVEL AND MULTILEVEL PROGRAMMING - A BIBLIOGRAPHY REVIEW [J].
VICENTE, LN ;
CALAMAI, PH .
JOURNAL OF GLOBAL OPTIMIZATION, 1994, 5 (03) :291-306
[30]  
Wessing S, 2017, 2017 IEEE LATIN AMERICAN CONFERENCE ON COMPUTATIONAL INTELLIGENCE (LA-CCI)