2022-08-13T11:44:51Zhttps://soar-ir.repo.nii.ac.jp/oaioai:soar-ir.repo.nii.ac.jp:000178372021-10-12T00:36:39Z1221:1222Analysis of runtime of optimization algorithms for noisy functions over discrete codomainsAkimoto, YouheiAstete-Morales, SandraTeytaud, OlivierDiscrete optimizationAdditive noiseRuntime analysisWe 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. (C) 2015 Elsevier B.V. All rights reserved.ArticleTHEORETICAL COMPUTER SCIENCE. 605:42-50 (2015)journal articleELSEVIER SCIENCE BV2015-11-15application/pdfTHEORETICAL COMPUTER SCIENCE60542500304-3975AA00862688https://soar-ir.repo.nii.ac.jp/record/17837/files/Analysis_runtime_optimization_algorithms_noisy_functions.pdfeng10.1016/j.tcs.2015.04.008https://doi.org/10.1016/j.tcs.2015.04.008© 2015. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/