A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Lim, D, Ong, Y-S, Jin, Y and Sendhoff, B (2007) A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation In: GECCO'07 Genetic and Evolutionary Computation Conference, 2007-07-07 - ?, London, UK.
Available under License : See the attached licence file.
Plain Text (licence)
Surrogate-Assisted Memetic Algorithm (SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since most of the objective function evaluations in SAMA are approximated, the search performance of SAMA is likely to be affected by the characteristics of the models used. In this paper, we study the search performance of using different meta modeling techniques, ensembles, and multi-surrogates in SAMA. In particular, we consider the SAMA-TRF, a SAMA model management framework that incorporates a trust region scheme for interleaving use of exact objective function with computationally cheap local meta models during local searches. Four different metamodels, namely Gaussian Process (GP), Radial Basis Function (RBF), Polynomial Regression (PR), and Extreme Learning Machine (ELM) neural network are used in the study. Empirical results obtained show that while some metamodeling techniques perform best on particular benchmark problems, ensemble of metamodels and multisurrogates yield robust and improved solution quality on the benchmark problems in general, for the same computational budget.
|Item Type:||Conference or Workshop Item (Conference Paper)|
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Identification Number :||10.1145/1276958.1277203|
|Additional Information :||© ACM, (2007). This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 9th annual conference on Genetic and evolutionary computation , (2007) http://doi.acm.org/10.1145/1276958.1277203|
|Depositing User :||Symplectic Elements|
|Date Deposited :||22 Mar 2012 10:31|
|Last Modified :||23 Sep 2013 18:49|
Actions (login required)
Downloads per month over past year