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
 H. Muhlenbein, “How genetic algorithms really work: I. mutation and hill climbing. parallel problem solving from nature 2. b. manderick,” 1992.
 S. Droste, T. Jansen, and I. Wegener, “On the analysis of the (1+ 1) evolutionary algorithm,” Theoretical Computer Science, vol. 276, no. 1, pp. 51-81, 2002.
 D. V. Arnold and H.-G. Beyer, “A General Noise Model and its Effects on Evolution Strategy Performance,” Evolutionary Computation, IEEE Transactions on, vol. 10, no. 4, pp. 380-391, 2006.
 H.-G. Beyer, The Theory of Evolution Strategies. Springer Science & Business Media, 2013.
 S. Astete-Morales, M.-L. Cauwet, J. Liu, and O. Teytaud, “Simple and cumulative regret for continuous noisy optimization,” Theoretical Computer Science, vol. 617, pp. 12-27, 2016.
 S. Astete-Morales, J. Liu, and O. Teytaud, “Log-log convergence for noisy optimization,” in International Conference on Artificial Evolution (Evolution Artificielle). Springer, 2013, pp. 16-28.
 J. Liu, “Portfolio Methods in Uncertain Contexts,” Ph.D. dissertation, INRIA, 12 2015.
 Y. Akimoto, S. Astete-Morales, and O. Teytaud, “Analysis of runtime of optimization algorithms for noisy functions over discrete codomains,” Theoretical Computer Science, vol. 605, pp. 42-50, 2015.
 J. D. Schaffer and L. J. Eshelman, “On Crossover as an Evolutionarily Viable Strategy,” in ICGA, vol. 91, 1991, pp. 61-68.
 S. Droste, “Analysis of the (1+ 1) EA for a Noisy OneMax,” in Genetic and Evolutionary Computation-GECCO 2004. Springer, 2004, pp. 1088-1099.