On multiplicative noise models for stochastic search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

On multiplicative noise models for stochastic search

Mohamed Jebalia
  • Function : Author
  • PersonId : 842777
Anne Auger
  • Function : Author
  • PersonId : 751513
  • IdHAL : anne-auger


In this paper we investigate multiplicative noise models in the context of continuous optimization. We illustrate how some intrinsic properties of the noise model imply the failure of reasonable search algorithms for locating the optimum of the noiseless part of the objective function. Those findings are rigorously investigated on the (1+1)-ES for the minimization of the noisy sphere function. Assuming a lower bound on the support of the noise distribution, we prove that the (1+1)-ES diverges when the lower bound allows to sample negative fitness with positive probability and converges in the opposite case. We provide a discussion on the practical applications and non applications of those outcomes and explain the differences with previous results obtained in the limit of infinite search-space dimensionality.
Fichier principal
Vignette du fichier
MohamedAnnePPSN08.ForHal.pdf (280.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00287725 , version 1 (18-08-2008)


  • HAL Id : inria-00287725 , version 1


Mohamed Jebalia, Anne Auger. On multiplicative noise models for stochastic search. Parallel Problem Solving From Nature, Sep 2008, dortmund, Germany. ⟨inria-00287725⟩
335 View
192 Download


Gmail Facebook Twitter LinkedIn More