EASE-ing into Global Optimization with LLMs
This paper presents an extended abstract describing an entry into the LLM for evolutionary algorithms tailored benchmarking competition using a GNBG-generated test suite. This study explores the generative design of optimization algorithms using large language models (LLMs) within the EASE modular framework, which supports iterative prompting and feedback-driven refinement. Across five successive generations, we observed a progressive transformation in algorithmic structure. The findings suggest opportunities for further research into the role of prompt design, feedback phrasing, and framework architecture in guiding the emergence of more task-adaptive, domain-specialized algorithmic behavior.
Authors
- Tomáš Kadavý (ORCID: https://orcid.org/0000-0002-3341-4336)
- Roman Šenkeřík (ORCID: https://orcid.org/0000-0002-5839-4263)
- Adam Viktorin (ORCID: https://orcid.org/0000-0003-0861-0340)
- Michal Pluháček (ORCID: https://orcid.org/0000-0002-3692-2838)
- Jozef Kováč (ORCID: https://orcid.org/0009-0008-8338-4981)
Institutions
- Jagiellonian University (PL)
- Tomas Bata University in Zlín (CZ)
- AGH University of Krakow (PL)
Publication Details
- Journal
- Proceedings of the Genetic and Evolutionary Computation Conference Companion
- Published
- 2025-07-14
- DOI
- https://doi.org/10.1145/3712255.3735096
- Primary Topic
- Simulation Techniques and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00