Evolving Agent Harnesses for Domain Specialization
arXiv — cs.AI · BoHao Chen · Published on Readzer
Summary
The paper proposes evolving the agent harness (system prompt, tool schemas, skill library, planning scaffolding) while keeping the policy frozen, using GEPA, a reflective evolutionary optimizer. Experiments with Codev on SWE-bench Verified, OfficeBench, and Terminal-Bench show harness evolution recovers most gains of weight updates at a fraction of the compute, and combining both is best. The authors argue harness adapters avoid failure modes of SFT-based specialization like shortened reasoning chains.
This is a reviewed summary. Read the complete article at the original source.
Why it matters by industry
- Artificial intelligence
Relevant to AI models and agents, as it introduces a compute-efficient alternative to weight updates for domain specialization, applicable to coding agents and potentially other embodied or multimodal systems.