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
This structural bias limits open-ended exploration, highlighting a tension in 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.
Paper Resources
Source Excerpt
When an 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 mu
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →RAIL Guard: Closing the Evaluation-to-Remediation Gap in Responsible AI for Agents
RAIL Guard introduces a closed-loop AI pipeline for large language models (LLMs) that evaluates outputs across eight dimensions and iteratively remediates failures, achieving 96.9% convergence compared to 49.1% for traditional block-and-retry methods. The system reduces unsafe agent executions by 33% without impacting task completion and is available as open-source SDKs.