Differential evolution for strongly noisy optimization: Use 1.01n resamplings at iteration n and Reach the -1/2 slope

Shih Yuan CHIU, Ching Nung LIN, Jialin LIU, Tsan-Cheng SU, Fabien TEYTAUD, Olivier TEYTAUD, Shi Jim YEN

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Referred Conference Paperpeer-review

6 Citations (Scopus)

Abstract

This paper is devoted to noisy optimization in case of a noise with standard deviation as large as variations of the fitness values, specifically when the variance does not decrease to zero around the optimum. We focus on comparing methods for choosing the number of resamplings. Experiments are performed on the differential evolution algorithm. By mathematical analysis, we design a new rule for choosing the number of resamplings for noisy optimization, as a function of the dimension, and validate its efficiency compared to existing heuristics.

Original languageEnglish
Title of host publication2015 IEEE Congress on Evolutionary Computation, CEC 2015 : Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages338-345
Number of pages8
ISBN (Electronic)9781479974924
DOIs
Publication statusPublished - 2015
Externally publishedYes
EventIEEE Congress on Evolutionary Computation, CEC 2015 - Sendai, Japan
Duration: 25 May 201528 May 2015

Conference

ConferenceIEEE Congress on Evolutionary Computation, CEC 2015
Country/TerritoryJapan
CitySendai
Period25/05/1528/05/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Keywords

  • Differential Evolution
  • Noisy Optimization
  • Resampling

Fingerprint

Dive into the research topics of 'Differential evolution for strongly noisy optimization: Use 1.01n resamplings at iteration n and Reach the -1/2 slope'. Together they form a unique fingerprint.

Cite this