HappyCat --- a simple function class where well-known direct search algorithms do fail

  • Authors:
  • Hans-Georg Beyer;Steffen Finck

  • Affiliations:
  • Research Center Process and Product Engineering, Department of Computer Science, Vorarlberg University of Applied Sciences, Dornbirn, Austria;Research Center Process and Product Engineering, Department of Computer Science, Vorarlberg University of Applied Sciences, Dornbirn, Austria

  • Venue:
  • PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new class of simple and scalable test functions for unconstrained real-parameter optimization will be proposed. Even though these functions have only one minimizer, they yet appear difficult to be optimized using standard state-of-the-art EAs such as CMA-ES, PSO, and DE. The test functions share properties observed when evolving at the edge of feasibility of constraint problems: while the step-sizes (or mutation strength) drops down exponentially fast, the EA is still far way from the minimizer giving rise to premature convergence. The design principles for this new function class, called HappyCat, will be explained. Furthermore, an idea for a new type of evolution strategy, the Ray-ES, will be outlined that might be able to tackle such problems.