Fitness-AUC Bandit Adaptive Strategy Selection vs. the Probability Matching one within Differential Evolution: An Empirical Comparison on the BBOB-2010 Noiseless Testbed
Résumé
The choice of which of the available strategies should be used within the Differential Evolution algorithm for a given problem is not trivial, besides being problem-dependent and very sensitive with relation to the algorithm performance. This decision can be made in an autonomous way, by the use of the Adaptive Strategy Selection paradigm, that continuously selects which strategy should be used for the next offspring generation, based on the performance achieved by each of the available ones on the current optimization process, i.e., while solving the problem. In this paper, we use the BBOB-2010 noiseless benchmarking suite to better empirically validate a comparison-based technique recently proposed to do so, the Fitness-based Area-Under-Curve Bandit, referred to as F-AUC-Bandit. It is compared with another recently proposed approach that uses Probability Matching technique based on the relative fitness improvements, referred to as PM-AdapSS-DE.
Domaines
Intelligence artificielle [cs.AI]
Fichier principal
faucbandit-bbob10.pdf (1.73 Mo)
Télécharger le fichier
slidesBBOB10.pdf (813.26 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Format | Autre |
---|
Loading...