Sarah Gerner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sarah Gerner has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Gabor
LMU Munich, Munich, Germany
3 shared publications - Gerhard Stenzel
LMU Munich, Munich, Germany
2 shared publications - Maximilian Zorn
Mobile and Distributed Systems Group LMU Munich Germany
2 shared publications - Michael Kölle
LMU Munich Munich Germany
1 shared publication - Philipp Altmann
LMU Munich, Munich, Germany
1 shared publication
Latest Publications
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 397-400
Towards Variation via Foundation Model: An Empirical Study of a Problem-Agnostic No-Code LLM-Guided Evolutionary Algorithm
The natural-language-based genetic algorithm (NaLaGA) shows that a generic, problem-independent genetic algorithm (GA) can function by utilizing large language models (LLMs) for all interactions with the solution candidates without ever running any LLM-generated code. We analyze inherent biases in the function of a NaLaGA approach from prior work and propose some architectural changes to increase its generalizability.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 397-400
Open AccessTowards Variation via Foundation Model: An Empirical Study of a Problem-Agnostic No-Code LLM-Guided Evolutionary Algorithm
The natural-language-based genetic algorithm (NaLaGA) shows that a generic, problem-independent genetic algorithm (GA) can function by utilizing large language models (LLMs) for all interactions with the solution candidates without ever running any LLM-generated code. We analyze inherent biases in the function of a NaLaGA approach from prior work and propose some architectural changes to increase its generalizability.
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 699-702
A General Genetic Algorithm Using Natural Language Evolutionary Operators
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 699-702
Open AccessA General Genetic Algorithm Using Natural Language Evolutionary Operators
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 583-586
Final Productive Fitness for Surrogates in Evolutionary Algorithms
Final productive fitness is an a posteriori fitness estimate for evolutionary algorithms that takes into account the fitness of an individual's descendants. We use that metric in the context of surrogate-based evolutionary algorithms to show that computing a surrogate not for the original objective function but for the final productive fitness based on said objective function improves optimization properties of the surrogate function and might thus be a useful tool for certain dynamic optimization problems.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 583-586
Open AccessFinal Productive Fitness for Surrogates in Evolutionary Algorithms
Final productive fitness is an a posteriori fitness estimate for evolutionary algorithms that takes into account the fitness of an individual's descendants. We use that metric in the context of surrogate-based evolutionary algorithms to show that computing a surrogate not for the original objective function but for the final productive fitness based on said objective function improves optimization properties of the surrogate function and might thus be a useful tool for certain dynamic optimization problems.