Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive (2404.04015v1)

Published 5 Apr 2024 in cs.NE

Abstract: We propose a new, flexible approach for dynamically maintaining successful mutation rates in evolutionary algorithms using $k$-bit flip mutations. The algorithm adds successful mutation rates to an archive of promising rates that are favored in subsequent steps. Rates expire when their number of unsuccessful trials has exceeded a threshold, while rates currently not present in the archive can enter it in two ways: (i) via user-defined minimum selection probabilities for rates combined with a successful step or (ii) via a stagnation detection mechanism increasing the value for a promising rate after the current bit-flip neighborhood has been explored with high probability. For the minimum selection probabilities, we suggest different options, including heavy-tailed distributions. We conduct rigorous runtime analysis of the flexible evolutionary algorithm on the OneMax and Jump functions, on general unimodal functions, on minimum spanning trees, and on a class of hurdle-like functions with varying hurdle width that benefit particularly from the archive of promising mutation rates. In all cases, the runtime bounds are close to or even outperform the best known results for both stagnation detection and heavy-tailed mutations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Fast mutation in crossover-based algorithms. Algorithmica 84 (2022), 1724–1761. https://doi.org/10.1007/s00453-022-00957-5
  2. Denis Antipov and Benjamin Doerr. 2020. Runtime analysis of a heavy-tailed (1+(λ,λ))1𝜆𝜆{(1+(\lambda,\lambda))}( 1 + ( italic_λ , italic_λ ) ) genetic algorithm on jump functions. In Prof. of PPSN ’20. Springer, 545–559. https://doi.org/10.1007/978-3-030-58115-2_38
  3. Fast immune system-inspired hypermutation operators for combinatorial optimization. IEEE Transactions on Evolutionary Computation 25, 5 (2021), 956–970. https://doi.org/10.1109/TEVC.2021.3068574
  4. Escaping local optima with non-elitist evolutionary algorithms. In Proc. of AAAI ’21. AAAI Press, 12275–12283. https://doi.org/10.1609/AAAI.V35I14.17457
  5. Fast non-elitist evolutionary algorithms with power-law ranking selection. In Proc. of GECCO ’22. ACM, 1372–1380. https://doi.org/10.1145/3512290.3528873
  6. Benjamin Doerr. 2020. Probabilistic tools for the analysis of randomized optimization heuristics. In Theory of Evolutionary Computation – Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 1–87. https://doi.org/10.1007/978-3-030-29414-4_1
  7. Benjamin Doerr and Carola Doerr. 2015. Optimal parameter choices through self-adjustment: Applying the 1/5-th rule in discrete settings. In Proc. of GECCO ’15. ACM Press, 1335–1342. https://doi.org/10.1145/2739480.2754684
  8. Benjamin Doerr and Carola Doerr. 2020. Theory of parameter control for discrete black-box optimization: Provable performance gains through dynamic parameter choices. In Theory of Evolutionary Computation – Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 271–321. https://doi.org/10.1007/978-3-030-29414-4_1
  9. k𝑘kitalic_k-bit mutation with self-adjusting k𝑘kitalic_k outperforms standard bit mutation. In Proc. of PPSN ’16. Springer, 824–834. https://doi.org/10.1007/978-3-319-45823-6_77
  10. Towards a stronger theory for permutation-based evolutionary algorithms. In Proc. of GECCO ’22. ACM, 1390–1398. https://doi.org/10.1145/3512290.3528720
  11. Benjamin Doerr and Leslie Ann Goldberg. 2013. Adaptive Drift Analysis. Algorithmica 65, 1 (2013), 224–250. https://doi.org/10.1007/S00453-011-9585-3
  12. How well does the metropolis algorithm cope with local optima?. In Proc. of GECCO ’23. ACM, 1000–1008. https://doi.org/10.1145/3583131.3590390
  13. Multiplicative drift analysis. Algorithmica 64 (2012), 673–697. https://doi.org/10.1007/s00453-012-9622-x
  14. Fast genetic algorithms. In Proc. of GECCO ’17. 777–784. https://doi.org/10.1145/3071178.3071301
  15. Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation – Recent Developments in Discrete Optimization. Springer. https://doi.org/10.1007/978-3-030-29414-4
  16. Benjamin Doerr and Zhongdi Qu. 2023. A first runtime analysis of the NSGA-II on a multimodal problem. IEEE Transactions on Evolutionary Computation 27, 5 (2023), 1288–1297. https://doi.org/10.1109/TEVC.2023.3250552
  17. Benjamin Doerr and Amirhossein Rajabi. 2023. Stagnation detection meets fast mutation. Theoretical Computer Science 946 (2023), 113670. https://doi.org/10.1016/j.tcs.2022.12.020
  18. Heavy-tailed mutation operators in single-objective combinatorial optimization. In Proc. of PPSN ’18. Springer, 134–145. https://doi.org/10.1007/978-3-319-99253-2_11
  19. Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In Proc. of GECCO ’18. ACM, 293–300. https://doi.org/10.1145/3205455.3205515
  20. Jun He and Xin Yao. 2001. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127, 1 (2001), 51–81. https://doi.org/10.1016/S0004-3702(01)00058-3
  21. Thomas Jansen and Ingo Wegener. 1999. On the analysis of evolutionary algorithms – A proof that crossover really can help. In Proc. of ESA ’99. Springer, 184–193. https://doi.org/10.1007/3-540-48481-7_17
  22. Martin Krejca and Carsten Witt. 2020. Theory of estimation-of-distribution algorithms. In Theory of Evolutionary Computation – Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 405–442. https://doi.org/10.1007/978-3-030-29414-4
  23. Timo Kötzing and Martin S. Krejca. 2019. First-hitting times under drift. Theoretical Computer Science 796 (2019), 51–69. https://doi.org/10.1016/j.tcs.2019.08.021
  24. Johannes Lengler. 2020. Drift Analysis. In Theory of Evolutionary Computation – Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 89–131. https://doi.org/10.1007/978-3-030-29414-4_1
  25. Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes. Evolutionary Computation 28, 3 (2020), 437–461. https://doi.org/10.1162/EVCO_A_00258
  26. When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not. Artificial Intelligence 314 (2023), 103804:1–103804:23. https://doi.org/10.1016/J.ARTINT.2022.103804
  27. Frank Neumann and Ingo Wegener. 2007. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378 (2007), 32–40. https://doi.org/10.1016/j.tcs.2006.11.002
  28. Phan Trung Hai Nguyen and Dirk Sudholt. 2018. Memetic algorithms beat evolutionary algorithms on the class of hurdle problems. In Proc. of GECCO ’18. ACM, 1071–1078. https://doi.org/10.1145/3205455.3205456
  29. Evolutionary algorithms and submodular functions: Benefits of heavy-tailed mutations. Natural Computing 20, 3 (2021), 561–575. https://doi.org/10.1007/s11047-021-09841-7
  30. Biased mutation operators for subgraph-selection problems. IEEE Transaction on Evolutionary Computation 10, 2 (2006), 145–156. https://doi.org/10.1109/TEVC.2006.871251
  31. Amirhossein Rajabi and Carsten Witt. 2021. Stagnation detection in highly multimodal fitness landscapes. In Proc. of GECCO ’21. ACM Press, 1178–1186. https://doi.org/10.1145/3449639.3459336
  32. Amirhossein Rajabi and Carsten Witt. 2022. Self-adjusting evolutionary algorithms for multimodal optimization. Algorithmica 84, 6 (2022), 1694–1723. https://doi.org/10.1007/s00453-022-00933-z
  33. Amirhossein Rajabi and Carsten Witt. 2023. Stagnation detection with randomized local search. Evolutionary Computation 31, 1 (2023), 1–29. https://doi.org/10.1162/evco_a_00313
  34. I. Rechenberg. 1973. Evolutionstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog Verlag.
  35. Joachim Reichel and Martin Skutella. 2009. On the size of weights in randomized search heuristics. In Proc. of FOGA 2009. 21–28. https://doi.org/10.1145/1527125.1527130
  36. Günter Rudolph. 1997. Convergence properties of evolutionary algorithms. Verlag Dr. Kovač.
  37. M. Schumer and Kenneth Steiglitz. 1968. Adaptive step size random search. IEEE Transactions on Automatic Control 13, 3 (1968), 270–276. https://doi.org/10.1109/TAC.1968.1098903
  38. Dirk Sudholt. 2013. A new method for lower bounds on the running time of evolutionary algorithms. IEEE Transactions on Evolutionary Computation 17, 3 (2013), 418–435. https://doi.org/10.1109/TEVC.2012.2202241
  39. Ingo Wegener. 2001. Theoretical aspects of evolutionary algorithms. In Proc. of ICALP ’01. Springer, 64–78. https://doi.org/10.1007/3-540-48224-5_6
  40. Carsten Witt. 2014. Fitness levels with tail bounds for the analysis of randomized search heuristics. Information Processing Letters 114, 1-2 (2014), 38–41. https://doi.org/10.1016/J.IPL.2013.09.013
  41. Carsten Witt. 2023. How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. Theoretical Computer Science 940 (2023), 18–42. https://doi.org/10.1016/J.TCS.2022.08.014
  42. Dynamic mutation based Pareto optimization for subset selection. In Proc. of ICIC ’18. Springer, 25–35. https://doi.org/10.1007/978-3-319-95957-3_4
  43. Christine Zarges. 2020. Theoretical foundations of immune-inspired randomized search heuristics for optimization. In Theory of Evolutionary Computation – Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 443–474. https://doi.org/10.1007/978-3-030-29414-4_1
  44. Weijie Zheng and Benjamin Doerr. 2023. Theoretical analyses of multiobjective evolutionary algorithms on multimodal objectives. Evolutionary Computation 31, 4 (2023), 337–373. https://doi.org/10.1162/EVCO_A_00328
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now