← 研踪 PaperTrailarXiv:2604.14655 · v3
AgentGA: Evolving Code Solutions in Agent-Seed Space
首次提交 2026-04-16 14:03
版本更新 2026-11-16 12:13
雷达观测 2026-11-17 17:12
摘要
We present AgentGA, a framework that evolves autonomous code-generation runs by optimizing the agent seed: the task prompt plus optional parent archives that initialize a fresh workspace. The outer loop searches over reusable starting conditions rather than editing code directly. Each generation launches a fresh autonomous run in an isolated workspace, while selected parent archives provide inherited artifacts that descendants can inspect and reuse. AgentGA couples a population-level genetic algorithm with long-horizon agents, deterministic 1:1 elite tournaments, and online operator allocation through a modified Hedge controller. We evaluate the approach for tabular AutoML on the 16-competition Weco-Kaggle Lite benchmark, including model-matched AIDE and AutoGluon comparisons. AgentGA with DeepSeek V4 Flash (0731) achieves 71.13% mean Exceeds % of Human, compared with 57.61% for model-matched AIDE and 57.89% for AutoGluon, outranking AIDE on 14/16 tasks. A control that removes inheritance, in which every agent starts from scratch, reaches 65.76% under AgentGA's stopping rule and 67.25% at the full budget, above a single long-lived agent (61.20%) and below AgentGA. These descriptive results support agent-seed optimization as a practical design choice for autonomous code-search systems, without isolating the causal contribution of inheritance.
作者备注:42 pages total (10-page main text + references + appendix), 11 figures, 21 tables
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v3 · 2026-11-16 12:13 · 最新观测版本
AgentGA: Evolving Code Solutions in Agent-Seed Space
We present AgentGA, a framework that evolves autonomous code-generation runs by optimizing the agent seed: the task prompt plus optional parent archives that initialize a fresh workspace. The outer loop searches over reusable starting conditions rather than editing code directly. Each generation launches a fresh autonomous run in an isolated workspace, while selected parent archives provide inherited artifacts that descendants can inspect and reuse. AgentGA couples a population-level genetic algorithm with long-horizon agents, deterministic 1:1 elite tournaments, and online operator allocation through a modified Hedge controller. We evaluate the approach for tabular AutoML on the 16-competition Weco-Kaggle Lite benchmark, including model-matched AIDE and AutoGluon comparisons. AgentGA with DeepSeek V4 Flash (0731) achieves 71.13% mean Exceeds % of Human, compared with 57.61% for model-matched AIDE and 57.89% for AutoGluon, outranking AIDE on 14/16 tasks. A control that removes inheritance, in which every agent starts from scratch, reaches 65.76% under AgentGA's stopping rule and 67.25% at the full budget, above a single long-lived agent (61.20%) and below AgentGA. These descriptive results support agent-seed optimization as a practical design choice for autonomous code-search systems, without isolating the causal contribution of inheritance.
查看此版本解读 →查看此版本原文 ↗