AIAny
Icon for item

Self-Evolving Agent Harness

Defines a feedback-driven lifecycle that lets an agent's harness (prompts, memory, workflows, tools, control logic) iteratively self-revise across runs while keeping model weights fixed. Distinguishes interpreted vs executable updates, frames search as evolutionary, and gives a fresh-validation admission rule.

Introduction

Why this matters The paper argues that an AI agent can accumulate behavioral and procedural improvements by letting its surrounding software scaffolding—prompts, memory, workflows, tools, and repository logic—learn from execution feedback, without retraining the underlying model. The core insight is practical: persistent, validated changes to harness state let fixed-weight models adapt to shifting tasks and environments, but only when admission and validation are designed to prevent regressions.

Key Findings
  • A clear operational taxonomy: separates interpreted-state updates (instructions, stored experience, task coordination) from executable revisions (component implementations, control logic, plugin composition). This distinction helps reason about persistence, propagation, and rollback complexity.
  • Evolutionary search framing: maps candidate-generation and selection to evolutionary structures and shows how common harness update loops correspond to different search patterns, clarifying reuse and failure modes.
  • Conditional theoretical guarantees: under explicit stability and independence assumptions the paper derives an expected generalization bound, a retention bound conditional on regression budgets, and a high-probability admission rule that requires fresh, independent validation data.
  • Systems and safety implications: persistent harness changes affect knowledge sharing, operational workflows, and attack/repair surfaces—motivating continual validation, independent safeguards for admission, and scoped runtime privileges.
Who it's for and tradeoffs

Great fit if you research agent design, build scaffolding for LLM-based systems, or need a principled way to let orchestration logic adapt without model fine-tuning. The approach clarifies what can safely change (interpreted state) versus what requires stricter controls (executable code, plugins) and gives a practical admission test for empirical improvements. Look elsewhere if you need end-to-end learning guarantees without strong independence assumptions, or if your deployment executes high-consequence physical actions without independent verification—the paper’s guarantees are explicitly conditional and require fresh validation and regression budgeting to be reliable.

Information

  • Websitearxiv.org
  • OrganizationsAffiliation: Zhongguancun Academy, Affiliation: University of Science and Technology of China, Affiliation: Zhongguancun Institute of Artificial Intelligence, Affiliation: Corresponding author
  • AuthorsChuyang Wei, Haoxiang Guan, Minghang Zhu, Kexin Zhou, Jiyan He, Xiren Zhou, Huanhuan Chen, Yifei Shen
  • Published date2026/10/13

Categories

More Items

Post-training pipeline that boosts game-control transfer by fine-tuning on 6,044 curated gameplay trajectories and then continuing training with PPO across 16 synthetic 2D/3D environments, extending the keyboard/mouse action space with relative pointer motion, sustained inputs, and composite actions.

Presents Jeva, a decision-native architecture that encodes requests and each candidate separately to produce permutation-invariant, option-scalable probability distributions with explicit null detection and reusable option representations for low-latency decision tasks.

Reframes city-scale 3D visual grounding as active spatial search: a VLM agent interacts with a multi-view BEV environment to query landmarks, zoom, render oblique views, and commit world-aligned bounding boxes. Trains a tool-use policy with reinforcement learning on CityRefer, improving Hit@1, IoU, and inference speed over ranking baselines.