Skip to content
Preprint

Rethinking Self-Evolving Agents: Do We Still Need Prescribed Optimization Pipelines?

Aug 2026 · 3 citations · 24 references
Computer Science

TL;DR

This work introduces Open-Ended Optimization (OEO), which keeps the objective, permitted interactions, resource budget, data boundary, and evaluation fixed while allowing the optimizer to compose the improvement process online.

Abstract

Self-evolving agents are usually built around prescribed optimization pipelines: the framework decides how to gather evidence, revise a persistent artifact, select candidates, and stop. We ask whether this task-specific procedure remains necessary when a frontier model acts as the optimizer. We introduce Open-Ended Optimization (OEO), which keeps the objective, permitted interactions, resource budget, data boundary, and evaluation fixed while allowing the optimizer to compose the improvement process online. We compare OEO with two complementary prescribed approaches: SkillOpt, a staged pipeline with bounded edits, and GEPA, a reflective evolutionary search. Across 14 head-to-head comparisons over 8 benchmark-target-model settings, GPT-5.5-driven OEO records 12 wins, 1 tie, and 1 narrow loss of 0.21 percentage points. It uses a median 34.3 percent of SkillOpt's configured target-interaction token budget. A one-shot, zero-interaction control shows that the gains are not explained by a single prior-driven rewrite. However, delegation has a capability boundary: SkillOpt outperforms OEO with a medium optimizer, and a weak optimizer cannot operate through the unchanged OEO interface. In the fully instrumented OEO-SkillOpt pair, trajectory analysis further shows that prescription changes how optimization proceeds more consistently than it changes final behavior. Together, these findings recast prescribed pipelines as capability-dependent scaffolding: essential constraints remain external, but a sufficiently capable optimizer can compose the route from measurable feedback to persistent improvement.

View source

Similar papers

Preprint Jul 2026

Rethinking Self-Evolving Agent Skills: Feedback Dynamics over Multiple Rounds

Overall, persistent skill self-evolution is better understood as sparse, validation-filtered search with model- and benchmark-dependent returns, rather than steady improvement from additional rounds.

Yuxuan Liu, Zhaochen Su, Yuhao Zhang et al. · 2 citations
#artificial intelligence Preprint Sep 2026

RobustSGPO: Search-Space Control for Agent Harness Evolution

This work introduces RobustSGPO, which specifies the requested edit, constructs and checks the patch, and continues search from either the incumbent or retained snapshots, and reduces source-task degradation after a shift, whereas random retention reaches a higher destination endpoint.

Zi-Bo Zhao, Ji-Jun Shi, Mo-Qing Zhou et al. · 1 citation
Preprint Jul 2026

DarwinX: Evolving Agent Harnesses Through Natural Selection

DarwinX is introduced, which treats self-evolution as selection over a population of harnesses with the model frozen: a preserve-and-extend contract admits only variants that extend coverage without regressing, an archive keeps alternative lineages for recombination, and failure-, teacher-, and self-derived evidence sh...

Yifang Zhang, Yutong Dai, Juntao Tan et al. · 2 citations · ⚡1
Preprint Aug 2026

StarHarness: Evolving Harnesses with Stratified Search for Enterprise Environments

StarHarness offers a practical way to reduce persistent model-environment mismatch in tool-rich enterprise tasks by stratifying tasks according to baseline failure behavior, separating proposer-visible search tasks from proposer-hidden selection tasks, and reserves held-out tasks for evaluating generalization.

Esakkivel Esakkiraja, D. Akhiyarov, Vikas Yadav et al. · 1 citation
Review Aug 2026

Ouroboros: A Self-Developing Frontier Coding Agent with Reviewed Core Evolution

We present Ouroboros, a self-developing agent harness whose tools, prompts, context assembly, and core implementation improve through reviewed commits that become the runtime for later work. Core evolution proceeds in two modes. In recursive free evolution, improvement is itself a task, and completing one evolution cyc...

Anton Razzhigaev, Andrei Gritsaev, Andrei Kaznacheev et al. · 4 citations · ⚡1
Jul 2026

Reward-Free Evolving Agents via Pairwise Validator

A pairwise validator is proposed: a frozen LLM that, given the parent and child candidate, returns a binary verdict on which is better, which mitigates the need for strict scale calibration.

Minghao Liu, Yu Wang, Jiayun Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.