Optimal resampling for the noisy OneMax problem

Preprint English OPEN
Liu, Jialin; Fairbank, Michael; Pérez-Liébana, Diego; Lucas, Simon M.;
  • Subject: Computer Science - Artificial Intelligence | I.2.8 | Computer Science - Neural and Evolutionary Computing
    acm: MathematicsofComputing_NUMERICALANALYSIS
    arxiv: Computer Science::Neural and Evolutionary Computation

The OneMax problem is a standard benchmark optimisation problem for a binary search space. Recent work on applying a Bandit-Based Random Mutation Hill-Climbing algorithm to the noisy OneMax Problem showed that it is important to choose a good value for the resampling nu... View more
Share - Bookmark