A mathematically derived number of resamplings for noisy optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A mathematically derived number of resamplings for noisy optimization

Abstract

In Noisy Optimization, one of the most common way to deal with noise is through resampling. In this paper, we compare various resampling rules applied to Evolution Strategy (ES). The goal is to provide a conclusive answer for resampling rules in simple settings. We use a variant of ES as our main algorithm: Self-Adaptive (μ/μ,λ)-Evolution Strategy. We focus our attention on local noisy optimization. In other words, we are interested in situation where reducing the noise is more important than avoiding local minima. We study different sampling rules on the noisy sphere function and compare them experimentally. We conclude that there exists parameter-free formulas that provide adequate resampling rules.
Fichier principal
Vignette du fichier
bignoise2xp_short.pdf (80.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00979442 , version 1 (16-04-2014)

Identifiers

  • HAL Id : hal-00979442 , version 1

Cite

Jialin Liu, David L. Saint-Pierre, Olivier Teytaud. A mathematically derived number of resamplings for noisy optimization. Companion - Genetic and Evolutionary Computation Conference (GECCO 2014), Jul 2014, Vancouver, Canada. pp.61-62. ⟨hal-00979442⟩
364 View
336 Download

Share

Gmail Facebook Twitter LinkedIn More