Criteria and Convergence Rates in Noisy Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Poster Communications Year : 2015

Criteria and Convergence Rates in Noisy Optimization


In an optimization framework, some criteria might be more relevant than others; the internal computational cost of the optimization algorithm might be negligible or not; the quality of intermediate search points might be important or not. For this reason measuring the performance of an algorithm is a delicate task. In addition, the usual criteria are often approximated for the sake of simplicity of the analysis, or for simplifying the design of test beds. This situation makes sense both in noise-free and noisy settings; however it is more often crucial in the latter case. We here discuss and compare several performance criteria published in the literature in the case of noisy optimization. We review existing rates, for various existing criteria, propose new rates, and check if some classically observed criteria are good approximations of sound criteria.
Fichier principal
Vignette du fichier
extendedabstractasr.pdf (186.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01217128 , version 1 (20-10-2015)
hal-01217128 , version 2 (19-01-2016)



Sandra Astete-Morales, Marie-Liesse Cauwet, Olivier Teytaud. Criteria and Convergence Rates in Noisy Optimization. Genetic and Evolutionary Computation Conference (GECCO 2015), Jul 2015, Madrid, Spain. 2015, ⟨10.1145/2739482.2764722⟩. ⟨hal-01217128v2⟩
255 View
221 Download



Gmail Facebook X LinkedIn More