Gaussian Process Surrogate Models for the CMA Evolution Strategy

被引:39
作者
Bajer, Lukas [1 ]
Pitra, Zbynek [2 ]
Repicky, Jakub [1 ]
Holena, Martin [3 ]
机构
[1] Charles Univ Prague, Fac Math & Phys, Malostran Nam 25, Prague 11800, Czech Republic
[2] Czech Tech Univ, Fac Nucl Sci & Phys Engn, Brehova 7, Prague 11519, Czech Republic
[3] Czech Acad Sci, Inst Comp Sci, Vodarenskou Vezi 2, Prague 18207, Czech Republic
关键词
Black-box optimization; surrogate modeling; Gaussian processes; evolution strategies; CMA-ES; OPTIMIZATION; ALGORITHMS;
D O I
10.1162/evco_a_00244
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This article deals with Gaussian process surrogate models for the Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES)-several already existing and two by the authors recently proposed models are presented. The work discusses different variants of surrogate model exploitation and focuses on the benefits of employing the Gaussian process uncertainty prediction, especially during the selection of points for the evaluation with a surrogate model. The experimental part of the article thoroughly compares and evaluates the five presented Gaussian process surrogate and six other state-of-the-art optimizers on the COCO benchmarks. The algorithm presented in most detail, DTS-CMA-ES, which combines cheap surrogate-model predictions with the objective function evaluations in every iteration, is shown to approach the function optimum at least comparably fast and often faster than the state-of-the-art black-box optimizers for budgets of roughly 25-100 function evaluations per dimension, in 10- and less-dimensional spaces even for 25-250 evaluations per dimension.
引用
收藏
页码:665 / 697
页数:33
相关论文
共 46 条
[11]  
Auger A, 2004, LECT NOTES COMPUT SC, V3242, P182
[12]  
Auger A., 2013, GECCO 2013, P1225
[13]   Surrogate-assisted design optimization of photonic directional couplers [J].
Bekasiewicz, Adrian ;
Koziel, Slawomir .
INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS, 2017, 30 (3-4)
[14]   Per Instance Algorithm Configuration of CMA-ES with Limited Budget [J].
Belkhir, Nacim ;
Dreo, Johann ;
Saveant, Pierre ;
Schoenauer, Marc .
PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, :681-688
[15]  
Brent R. P., 1973, PRENTICE HALL SERIES
[16]   Accelerating evolutionary algorithms with Gaussian process fitness function models [J].
Büche, D ;
Schraudolph, NN ;
Koumoutsakos, P .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2005, 35 (02) :183-194
[17]   A trust region method based on interior point techniques for nonlinear programming [J].
Byrd, RH ;
Gilbert, JC ;
Nocedal, J .
MATHEMATICAL PROGRAMMING, 2000, 89 (01) :149-185
[18]  
Emmerich M., 2002, Parallel Problem Solving from Nature - PPSN VII. 7th International Conference. Proceedings (Lecture Notes in Computer Science Vol.2439), P361
[19]   Single-objective and multiobjective evolutionary optimization assisted by Gaussian random field metamodels [J].
Emmerich, Michael T. M. ;
Giannakoglou, Kyriakos C. ;
Naujoks, Boris .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (04) :421-439
[20]  
Hansen N, 2006, STUD FUZZ SOFT COMP, V192, P75