Fetching the paper…
Reading the bibliography…
Large Language Models (LLMs) such as GPT-4 have demonstrated their ability to understand natural language and generate complex code snippets.
M. A. Jaro, “Advances in record-linkage methodology as applied to matching the 1985 census of Tampa, Florida,” Journal of the American Statistical Association , vol. 84, no. 406, pp. 414–420, 1989. [Online]. Available: https://www.tandfonline.com/doi/abs/10.1080/01621459.1989.10478785
1989
Earlier work this paper cites.
T. Bäck, D. B. Fogel, and Z. Michalewicz, “Handbook of evolutionary computation,” Release , vol. 97, no. 1, p. B1, 1997
1997
Earlier work this paper cites.
J. Kennedy and R. C. Eberhart, Swarm Intelligence . Morgan Kaufmann, 2001
2001
Earlier work this paper cites.
M. Dorigo and T. Stützle, Ant Colony Optimization . MIT Press, 2004
2004
Earlier work this paper cites.
N. Hansen, S. Finck, R. Ros, and A. Auger, “Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions,” INRIA, Tech. Rep. RR6829, 2009
2009
Earlier work this paper cites.
J. Zhang and A. C. Sanderson, “JADE: Adaptive differential evolution with optional external archive,” IEEE Transactions on Evolutionary Computation , vol. 13, no. 5, pp. 945–958, 2009
2009
Earlier work this paper cites.
N. Hansen, S. Finck, R. Ros, and A. Auger, “Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions,” INRIA, Research Report RR-6829, 2009. [Online]. Available: https://hal.inria.fr/inria-00362633
2009
Earlier work this paper cites.
N. Hansen and R. Ros, “Black-box optimization benchmarking of NEWUOA compared to BIPOP-CMA-ES: on the BBOB noiseless testbed,” in Proceedings of the 12th annual conference companion on Genetic and evolutionary computation , 2010, pp. 1519–1526
2010
Earlier work this paper cites.
H. Iba and N. Noman, Real-world Applications of Evolutionary Algorithms . Imperial College Press, UK, 2011, pp. 211–262. [Online]. Available: https://www.worldscientific.com/doi/abs/10.1142/9781848166820_0006
2011
Earlier work this paper cites.
R. Chiong, T. Weise, and Z. Michalewicz, Variants of evolutionary algorithms for real-world applications . Springer, 2012, vol. 2
2012
Earlier work this paper cites.
D. Brockhoff, A. Auger, and N. Hansen, “Comparing mirrored mutations and active covariance matrix adaptation in the IPOP-CMA-ES on the noiseless BBOB testbed,” in Proceedings of the 14th annual conference companion on Genetic and evolutionary computation , 2012, pp. 297–304
2012
Earlier work this paper cites.
P. Pošík and V. Klemš, “Benchmarking the differential evolution with adaptive encoding on noiseless functions,” in Proceedings of the 14th annual conference companion on Genetic and evolutionary computation , 2012, pp. 189–196
2012
Earlier work this paper cites.
A. E. Eiben and J. E. Smith, Introduction to evolutionary computing . Springer, 2015
2015
Earlier work this paper cites.
S. van Rijn, H. Wang, M. van Leeuwen, and T. Bäck, “Evolving the structure of evolution strategies,” in 2016 IEEE Symposium Series on Computational Intelligence (SSCI) , 2016, pp. 1–8
2016
Earlier work this paper cites.
2018
Earlier work this paper cites.
R. Cheng, C. He, Y. Jin, and X. Yao, “Model-based evolutionary algorithms: a short survey,” Complex & Intelligent Systems , vol. 4, no. 4, pp. 283–292, 2018
2018
Earlier work this paper cites.
M. Lindauer, K. Eggensperger, M. Feurer, A. Biedenkapp, D. Deng, C. Benjamins, T. Ruhkopf, R. Sass, and F. Hutter, “SMAC3: A versatile bayesian optimization package for hyperparameter optimization,” J. Mach. Learn. Res. , vol. 23, pp. 54:1–54:9, 2022. [Online]. Available: https://jmlr.org/papers/v23/21-0888.html
2018
Earlier work this paper cites.
C. Doerr, F. Ye, N. Horesh, H. Wang, O. M. Shir, and T. Bäck, “Benchmarking discrete optimization heuristics with IOHprofiler,” Appl. Soft Comput. , vol. 88, p. 106027, 2020. [Online]. Available: https://doi.org/10.1016/j.asoc.2019.106027
2019
Earlier work this paper cites.
C. L. Camacho-Villalón, M. Dorigo, and T. Stützle, “The intelligent water drops algorithm: why it cannot be considered a novel algorithm - A brief discussion on the use of metaphors in optimization,” Swarm Intell. , vol. 13, no. 3-4, pp. 173–192, 2019. [Online]. Available: https://doi.org/10.1007/s11721-019-00165-y
2019
Earlier work this paper cites.
C. L. Camacho-Villalón, T. Stützle, and M. Dorigo, “Grey wolf, firefly and bat algorithms: Three widespread algorithms that do not contain any novelty,” in Proc. of Swarm Intelligence (ANTS) , ser. LNCS, vol. 12421. Springer, 2020, pp. 121–133. [Online]. Available: https://doi.org/10.1007/978-3-030-60376-2\_10
2020
Earlier work this paper cites.
J. Del Ser, E. Osaba, A. D. Martinez, M. N. Bilbao, J. Poyatos, D. Molina, and F. Herrera, “More is not always better: insights from a massive comparison of meta-heuristic algorithms over real-parameter optimization problems,” in 2021 IEEE Symposium Series on Computational Intelligence (SSCI) . IEEE, 2021, pp. 1–7
2021
Earlier work this paper cites.
2021
Cited alongside, same era.
J. de Nobel, D. Vermetten, H. Wang, C. Doerr, and T. Bäck, “Tuning as a means of assessing the benefits of new ideas in interplay with existing algorithmic modules,” in Proc. of Genetic and Evolutionary Computation Conference (GECCO’21, Companion material) . ACM, 2021, pp. 1375–1384. [Online]. Available: https://doi.org/10.1145/3449726.3463167
2021
Cited alongside, same era.
X. Xia, L. Tong, Y. Zhang, X. Xu, H. Yang, L. Gui, Y. Li, and K. Li, “Nfdde: A novelty-hybrid-fitness driving differential evolution algorithm,” Information Sciences , vol. 579, pp. 33–54, 2021. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0020025521007726
2021
Cited alongside, same era.
2023
Later among the works it cites.
2023
Later among the works it cites.
M. Pluhacek, A. Kazikova, T. Kadavy, A. Viktorin, and R. Senkerik, “Leveraging large language models for the generation of novel metaheuristic optimization algorithms,” in Proceedings of the Companion Conference on Genetic and Evolutionary Computation , ser. GECCO ’23 Companion. New York, NY, USA: Association for Computing Machinery, 2023, p. 1812–1820. [Online]. Available: https://doi.org/10.1145/3583133.3596401
2023
Later among the works it cites.
M. I. E. Khaldi and A. Draa, “Surrogate-assisted evolutionary optimisation: a novel blueprint and a state of the art survey,” Evolutionary Intelligence , pp. 1–31, 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2022
Cited alongside, same era.
C. L. Camacho-Villalón, M. Dorigo, and T. Stützle, “Pso-x: A component-based framework for the automatic design of particle swarm optimization algorithms,” IEEE Transactions on Evolutionary Computation , vol. 26, no. 3, pp. 402–416, 2022
2022
Cited alongside, same era.
2022
Cited alongside, same era.
H. Wang, D. Vermetten, F. Ye, C. Doerr, and T. Bäck, “IOHanalyzer: Detailed performance analyses for iterative optimization heuristics,” ACM Trans. Evol. Learn. Optim. , vol. 2, no. 1, pp. 3:1–3:29, 2022. [Online]. Available: https://doi.org/10.1145/3510426
2022
Cited alongside, same era.
Y. Zhou, A. I. Muresanu, Z. Han, K. Paster, S. Pitis, H. Chan, and J. Ba, “Large language models are human-level prompt engineers,” in NeurIPS 2022 Foundation Models for Decision Making Workshop , 2022. [Online]. Available: https://openreview.net/forum?id=YdqwNaCLCx
2022
Cited alongside, same era.
2022
Cited alongside, same era.
N. Hansen, A. Auger, D. Brockhoff, and T. Tušar, “Anytime performance assessment in blackbox optimization benchmarking,” IEEE Transactions on Evolutionary Computation , vol. 26, no. 6, pp. 1293–1305, 2022
2022
Cited alongside, same era.
H. Wang, D. Vermetten, F. Ye, C. Doerr, and T. Bäck, “IOHanalyzer: Detailed performance analyses for iterative optimization heuristics,” ACM Transactions on Evolutionary Learning and Optimization , vol. 2, no. 1, apr 2022. [Online]. Available: https://doi.org/10.1145/3510426
2022
Cited alongside, same era.
C. Aranha, C. L. Camacho-Villalón, F. Campelo, M. Dorigo, R. Ruiz, M. Sevaux, K. Sörensen, and T. Stützle, “Metaphor-based metaheuristics, a call for action: the elephant in the room,” Swarm Intell. , vol. 16, no. 1, pp. 1–6, 2022. [Online]. Available: https://doi.org/10.1007/s11721-021-00202-9
2022
Cited alongside, same era.
2023
Later among the works it cites.
2023
Later among the works it cites.
D. Vermetten, C. Doerr, H. Wang, A. V. Kononova, and T. Bäck, “Large-scale benchmarking of metaphor-based optimization heuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference , ser. GECCO ’24. New York, NY, USA: Association for Computing Machinery, 2024, p. 41–49. [Online]. Available: https://doi.org/10.1145/3638529.3654122
2024
Closest in time.
——, “IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics,” Evolutionary Computation , pp. 1–6, 02 2024. [Online]. Available: https://doi.org/10.1162/evco\_a\_00342
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
B. Romera-Paredes, M. Barekatain, A. Novikov, M. Balog, M. P. Kumar, E. Dupont, F. J. Ruiz, J. S. Ellenberg, P. Wang, O. Fawzi, P. Kohli, and A. Fawzi, “Mathematical discoveries from program search with large language models,” Nature , vol. 625, pp. 468–475, 01 2024
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
N. van Stein, “LLaMEA,” Jun. 2024, zenodo. [Online]. Available: https://doi.org/10.5281/zenodo.11358116
2024
Closest in time.
OpenAI, “Chatgpt-3.5-turbo,” https://platform.openai.com/docs/models/gpt-3-5-turbo
2024
Closest in time.
——, “Chatgpt-4-turbo,” https://platform.openai.com/docs/models/gpt-4-turbo-and-gpt-4
2024
Closest in time.
——, “Chatgpt-4o,” https://platform.openai.com/docs/models/gpt-4o
2024
Closest in time.
2024
Closest in time.