SyncAI.news, a Varaisys broadcasting
T-GADE: Thermodynamical Generative-AI-Driven Evolution of LLM Artifacts
KO

Kyoko Ogawa, Naoki Mori

· 1 min read

ResearcharXiv cs.AI

T-GADE: Thermodynamical Generative-AI-Driven Evolution of LLM Artifacts

arXiv:2609.12286v2 Announce Type: replace Abstract: 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 $F_T=\langle E\rangle-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.

Original source

This story was published by arXiv cs.AI and written by Kyoko Ogawa, Naoki Mori. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News