Duc-Cuong Dang
Per Kristian Lehre
ABSTRACT
Complete and accurate information about the quality of candidate solutions is not always available in real-world optimisation. It is often prohibitively expensive to evaluate candidate solution on more than a few test cases, or the evaluation mechanism itself is unreliable. While evolutionary algorithms are popular methods in optimisation, the theoretical understanding is lacking for the case of partial information. This paper initiates runtime analysis of evolutionary algorithms where only partial information about fitness is available. Two scenarios are investigated. In partial evaluation of solutions, only a small amount of information about the problem is revealed in each fitness evaluation. We formulate a model that makes this scenario concrete for pseudo-Boolean optimisation. In partial evaluation of populations, only a few individuals in the population are evaluated, and the fitness values of the other individuals are missing or incorrect.
For both scenarios, we prove that given a set of specific conditions, non-elitist evolutionary algorithms can optimise many functions in expected polynomial time even when vanishingly little information available. The conditions imply a small enough mutation rate and a large enough population size. The latter emphasises the importance of populations in evolution.
- D.-C. Dang and P. K. Lehre. Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels. To appear in the Proceedings of the 16th Annual Conference on Genetic and Evolutionary Computation (GECCO'14), Vancouver, Canada, 2014. Google Scholar
Digital Library
- S. Droste. Analysis of the (1+1) EA for a dynamically bitwise changing OneMax. In Proceedings of the 2003 International Conference on Genetic and Evolutionary Computation, GECCO'03, pages 909--921, Berlin, Heidelberg, 2003. Springer-Verlag. Google ScholarDigital Library
- S. Droste. Analysis of the (1+1) EA for a noisy OneMax. In Proceedings of the 2004 International Conference on Genetic and Evolutionary Computation, GECCO'04, pages 1088--1099, Berlin, Heidelberg, 2004. Springer-Verlag.Google ScholarCross Ref
- B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 14(3):502--525, 1982.Google ScholarCross Ref
- Y. Jin. Surrogate-assisted evolutionary computation: Recent advances and future challenges. Swarm and Evolutionary Computation, 1(2):61--70, 2011.Google ScholarCross Ref
- Y. Jin and J. Branke. Evolutionary optimization in uncertain environments - a survey. IEEE Transactions on Evolutionary Computation, 9(3):303--317, 2005. Google ScholarDigital Library
- P. K. Lehre. Negative drift in populations. In Proceedings of the 11th International Conference on Parallel Problem Solving from Nature, PPSN'10, pages 244--253, Berlin, Heidelberg, 2010. Springer-Verlag. Google ScholarDigital Library
- P. K. Lehre. Fitness-levels for non-elitist populations. In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO'11, pages 2075--2082, New York, NY, USA, 2011. ACM. Google ScholarDigital Library
- P. K. Lehre. Drift analysis. In Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO'12, pages 1239--1258, New York, NY, USA, 2012. ACM. Google ScholarDigital Library
- P. K. Lehre and X. Yao. On the impact of mutation-selection balance on the runtime of evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 16(2):225--241, 2012.Google ScholarDigital Library
- B. L. Miller and D. E. Goldberg. Genetic algorithms, selection schemes, and the varying effects of noise. Evolutionary Computation, 4:113--131, 1996. Google ScholarDigital Library
- D. S. Mitrinović. Elementary Inequalities. P. Noordhoff Ltd, Groningen, 1964.Google Scholar
- M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005. Google ScholarDigital Library
- P. S. Oliveto, J. He, and X. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3):281--293, 2007.Google ScholarCross Ref
Index Terms
- Evolution under partial information
Recommendations
When non-elitism meets time-linkage problems
GECCO '21: Proceedings of the Genetic and Evolutionary Computation ConferenceMany real-world applications have the time-linkage property, and the only theoretical analysis is recently given by Zheng, et al. (TEVC 2021) on their proposed time-linkage OneMax problem, OneMax(0,1n). However, only two elitist algorithms (1 + 1) EA ...
When Non-Elitism Outperforms Elitism for Crossing Fitness Valleys
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Crossing fitness valleys is one of the major obstacles to function optimization. In this paper we investigate how the structure of the fitness valley, namely its depth d and length l, influence the runtime of different strategies for crossing these ...
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
Although widely applied in optimisation, relatively little has been proven rigorously about the role and behaviour of populations in randomised search processes. This paper presents a new method to prove upper bounds on the expected optimisation time of ...
Comments