Extreme Value Based Adaptive Operator Selection

  • Álvaro Fialho
  • Luís Da Costa
  • Marc Schoenauer
  • Michèle Sebag
Conference paper

DOI: 10.1007/978-3-540-87700-4_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)
Cite this paper as:
Fialho Á., Da Costa L., Schoenauer M., Sebag M. (2008) Extreme Value Based Adaptive Operator Selection. In: Rudolph G., Jansen T., Beume N., Lucas S., Poloni C. (eds) Parallel Problem Solving from Nature – PPSN X. PPSN 2008. Lecture Notes in Computer Science, vol 5199. Springer, Berlin, Heidelberg

Abstract

Credit Assignment is an important ingredient of several proposals that have been made for Adaptive Operator Selection. Instead of the average fitness improvement of newborn offspring, this paper proposes to use some empirical order statistics of those improvements, arguing that rare but highly beneficial jumps matter as much or more than frequent but small improvements. An extreme value based Credit Assignment is thus proposed, rewarding each operator with the best fitness improvement observed in a sliding window for this operator. This mechanism, combined with existing Adaptive Operator Selection rules, is investigated in an EC-like setting. First results show that the proposed method allows both the Adaptive Pursuit and the Dynamic Multi-Armed Bandit selection rules to actually track the best operators along evolution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Álvaro Fialho
    • 1
  • Luís Da Costa
    • 2
  • Marc Schoenauer
    • 1
    • 2
  • Michèle Sebag
    • 1
    • 2
  1. 1.Microsoft Research-INRIA Joint CentreOrsay CedexFrance
  2. 2.Team TAO, INRIA Saclay - Île-de-France & LRI (UMR CNRS 8623), Bât. 490, Université Paris-SudOrsay CedexFrance

Personalised recommendations