@techreport{RebolledoRehbachEibenetal., type = {Working Paper}, author = {Margarita Rebolledo and Frederik Rehbach and A.E. Eiben and Thomas Bartz-Beielstein}, title = {Parallelized Bayesian Optimization for Expensive Robot Controller Evolution}, url = {https://nbn-resolving.org/urn:nbn:de:hbz:832-cos4-9130}, pages = {12}, abstract = {An important class of black-box optimization problems relies on using simulations to assess the quality of a given candidate solution. Solving such problems can be computationally expensive because each simulation is very time-consuming. We present an approach to mitigate this problem by distinguishing two factors of computational cost: the number of trials and the time needed to execute the trials. Our approach tries to keep down the number of trials by using Bayesian optimization (BO) –known to be sample efficient– and reducing wall-clock times by parallel execution of trials. We compare the performance of four parallelization methods and two model-free alternatives. Each method is evaluated on all 24 objective functions of the Black-Box-Optimization- Benchmarking (BBOB) test suite in their five, ten, and 20-dimensional versions. Additionally, their performance is investigated on six test cases in robot learning. The results show that parallelized BO outperforms the state-of-the-art CMA-ES on the BBOB test functions, especially for higher dimensions. On the robot learning tasks, the differences are less clear, but the data do support parallelized BO as the ‘best guess’, winning on some cases and never losing.}, language = {en} }