Analysis of runtime of optimization algorithms for noisy functions over discrete codomains - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2015

Analysis of runtime of optimization algorithms for noisy functions over discrete codomains

Résumé

We consider in this work the application of optimization algorithms to problems over discrete codomains corrupted by additive unbiased noise. We propose a modification of the algorithms by repeating the fitness evaluation of the noisy function sufficiently so that, with a fix probability, the function evaluation on the noisy case is identical to the true value. If the runtime of the algorithms on the noise-free case is known, the number of resampling is chosen accordingly. If not, the number of resampling is chosen regarding to the number of fitness evaluations, in an anytime manner. We conclude that if the additive noise is Gaussian, then the runtime on the noisy case, for an adapted algorithm using resamplings, is similar to the runtime on the noise-free case: we incur only an extra logarithmic factor. If the noise is non-Gaussian but with finite variance, then the total runtime of the noisy case is quadratic in function of the runtime on the noise-free case.
Fichier principal
Vignette du fichier
discretenoise.pdf (300.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

Youhei Akimoto, Sandra Astete-Morales, Olivier Teytaud. Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theoretical Computer Science, 2015, 605, pp.42:50. ⟨10.1016/j.tcs.2015.04.008⟩. ⟨hal-01194556⟩
576 Consultations
312 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More