PROGRESS: Progressive reinforcement-learning-based surrogate selection

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In most engineering problems, experiments for evaluating the performance of different setups are time consuming, expensive, or even both. Therefore, sequential experimental designs have become an indispensable technique for optimizing the objective functions of these problems. In this context, most of the problems can be considered as a black-box. Specifically, no function properties are known a priori to select the best suited surrogate model class. Therefore, we propose a new ensemble-based approach, which is capable of identifying the best surrogate model during the optimization process by using reinforcement learning techniques. The procedure is general and can be applied to arbitrary ensembles of surrogate models. Results are provided on 24 well-known black-box functions to show that the progressive procedure is capable of selecting suitable models from the ensemble and that it can compete with state-of-the-art methods for sequential optimization. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Hess, S., Wagner, T., & Bischl, B. (2013). PROGRESS: Progressive reinforcement-learning-based surrogate selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7997 LNCS, pp. 110–124). https://doi.org/10.1007/978-3-642-44973-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free