Quasi-random numbers improve the CMA-ES on the BBOB testbed - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Quasi-random numbers improve the CMA-ES on the BBOB testbed

Résumé

Pseudo-random numbers are usually a good enough approximation of random numbers in evolutionary algorithms. But quasi-random numbers follow a different idea, namely they are aimed at being more regularly distributed than random points. It has been pointed out in earlier papers that quasi-random points provide a significant improvement in evolutionary optimization. In this paper, we experiment quasi-random mutations on a well known test case, namely the Coco/Bbob test case. We also include experiments on translated or rescaled versions of BBOB, on which we get similar improvements.
Fichier principal
Vignette du fichier
EAsource.pdf (2.25 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01194542 , version 1 (07-09-2015)

Identifiants

  • HAL Id : hal-01194542 , version 1

Citer

Olivier Teytaud. Quasi-random numbers improve the CMA-ES on the BBOB testbed. Artificial Evolution (EA2015), 2015, Lyon, France. pp.13. ⟨hal-01194542⟩
239 Consultations
240 Téléchargements

Partager

Gmail Facebook X LinkedIn More