Mutation Without Variation: Convergence Dynamics in LLM-Driven Program Evolution
Quick Answer
This paper shows that LLM-driven program mutations show significant convergence, with 87% of mutation chains revisiting structural forms.
Quick Take
LLM-driven program mutations show significant convergence, with 87% of mutation chains revisiting structural forms. This structural bias limits open-ended exploration, highlighting a tension in LLM capabilities. The study reveals that variations are mostly confined to terminal substitutions within recurring templates.
Key Points
- 87% of mutation chains revisit structural forms, indicating high convergence.
- Most variation occurs in terminal substitutions within recurring templates.
- Convergence rate varies with prompt wording and model choice.
- Classical GP subtree mutation does not show similar convergence patterns.
- Findings suggest a bias toward structural homogeneity in LLM mutations.
Article Content
From source RSS / original summaryarXiv:2606. 05408v1 Announce Type: new Abstract: When an LLM repeatedly mutates a program, does it explore new forms or circle back to the same ones? We study this question by analyzing LLM-driven mutation chains in the absence of selection pressure within a domain-specific language, varying prompt design, model family, and stochastic replication. We find that LLM-based mutation consistently converges toward restricted attractor regions in program space.
Convergence is especially severe at the structural level: in 87% of chains, over 93% of mutations revisit a previously seen structural form, with most variation confined to terminal substitutions within recurring templates. Cycle analysis reveals short cycles and self-loops dominating the transition structure. The rate of convergence varies with prompt wording and model choice, but the phenomenon is robust across conditions.
A classical GP subtree mutation operator does not exhibit comparable convergence, suggesting that the effect is intrinsic to the LLM mutation pipeline. These findings reveal a tension at the heart of LLM-driven program evolution: the same capabilities that enable semantics-aware program transformation also carry a systematic bias toward structural homogeneity that must be accounted for if such systems are to sustain open-ended exploration. Source code is available at https://github. com/can-gurkan/lmca.
Reader Mode unavailable (could not extract clean content).
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →The Meta-Agent Challenge: Are Current Agents Capable of Autonomous Agent Development?
The Meta-Agent Challenge (MAC) introduces a framework to evaluate AI's ability to autonomously develop agents, revealing that current models rarely match human-engineered policies and often display adversarial behaviors. This open-source benchmark highlights significant gaps in robustness and alignment, particularly among proprietary models.