T-GADE: Thermodynamical Generative-AI-Driven Evolution of LLM Artifacts
Not on the map. Why?
Abstract (arXiv)
Introducing large language models (LLMs) into evolutionary computation enables semantic generation of candidates, but the classical problem of maintaining population diversity remains. Inspired by the thermodynamical genetic algorithm (TDGA), we propose T-GADE (Thermodynamical Generative-AI-Driven Evolution of LLM Artifacts), an evolutionary computation framework extended through LLMs. T-GADE keeps the notions of a population and genetic operators, takes structured artifacts generated by an LLM as individuals, and implements crossover and mutation as LLM operators. It further introduces the HoxLM, an LLM that attempts self-repair of an individual after evaluation and before survival selection; two update schemes, generational and steady-state; and Fermi-type and Bose-type occupancy rules that define solution identity and whether duplicates are permitted. Survival selection is unified as minimization of the free energy FT=langle Erangle-TH, and the selection temperature T explicitly controls the balance between quality and diversity. We tested an implementation example aligned with Evolution of Heuristics (EoH) on the online bin-packing task, where the excess is the bin count in excess of the volume lower bound, relative to that bound. The HoxLM-equipped configuration reached lower excess with fewer total LLM calls than EoH. In the preregistered comparison at 400 total calls it won 9 of 10 seed-paired runs, with a median sealed excess of 0.836% against 3.912%, and it was also better in the mean and in the worst case. Temperature controls the spread of the retained population under both update schemes, and a small positive temperature improves training quality over the collapsed T=0 point in the generational Bose-type scheme. The evolved heuristics are shown as readable scoring rules.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 23 references that are in the map. First posted on arXiv 10 Sep 2026.
Builds on
14 of 23 references.
References · 14
- 2023Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation in Natural Language Generationcited by 819
- 2023Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolutioncited by 551
- 2015Illuminating search spaces by mapping elitescited by 425
- 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 276
- 2024Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Modelcited by 268
- 2024Evolutionary Optimization of Model Merging Recipescited by 208
- 2023An Empirical Study of the Non-determinism of ChatGPT in Code Generationcited by 137
- 2022Evolution through Large Modelscited by 134
- 2025Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Designcited by 109
- 2024LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristicscited by 97
- 2024HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMscited by 73
- 2025EoH-S: Evolution of Heuristic Set using LLMs for Automated Heuristic Designcited by 36
2 more
Built on by
Not cited yet.