Feature Based Algorithm Configuration: A Case Study with Differential Evolution - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Feature Based Algorithm Configuration: A Case Study with Differential Evolution

Abstract

Algorithm Configuration is still an intricate problem especially in the continuous black box optimization domain. This paper empirically investigates the relationship between continuous problem features (measuring different problem characteristics) and the best parameter configuration of a given stochastic algorithm over a bench of test functions — namely here, the original version of Differential Evolution over the BBOB test bench. This is achieved by learning an empirical performance model from the problem features and the algorithm parameters. This performance model can then be used to compute an empirical optimal parameter configuration from features values. The results show that reasonable performance models can indeed be learned, resulting in a better parameter configuration than a static parameter setting optimized for robustness over the test bench.
Fichier principal
Vignette du fichier
PPSN.pdf (478.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01359539 , version 1 (02-09-2016)

Identifiers

Cite

Nacim Belkhir, Johann Dréo, Pierre Savéant, Marc Schoenauer. Feature Based Algorithm Configuration: A Case Study with Differential Evolution. Parallel Problem Solving from Nature – PPSN XIV, Sep 2016, Edinburgh, France. pp.156-165, ⟨10.1007/978-3-319-45823-6_15⟩. ⟨hal-01359539⟩
486 View
343 Download

Altmetric

Share

Gmail Facebook X LinkedIn More