RoboPhD: Evolving Diverse Complex Agents Under Tight Evaluation Budgets

TL;DR

RoboPhD systematically compares three optimization methods for evolving complex agents under limited evaluation budgets, demonstrating RoboPhD's superior performance in most benchmarks and releasing it as an open toolkit.

Contribution

This work introduces RoboPhD, a validation-free evolution method that outperforms existing approaches in diverse tasks with fixed evaluation budgets.

Findings

RoboPhD outperforms GEPA and Autoresearch on three of four benchmarks.

RoboPhD evolves a 22-line seed into a 1,013-line multi-strategy system.

RoboPhD improves accuracy from 27.8% to 65.8% on ARC-AGI.

Abstract

2026 has brought an explosion of interest in LLM-guided evolution of agentic artifacts, with systems like GEPA and Autoresearch demonstrating that LLMs can iteratively improve prompts, code, and agent architectures across diverse domains. As adoption accelerates, a central question emerges: given the same information, the same seed agent, and the same objective, which optimization algorithm yields the best results under the same evaluation budget? This question becomes critical when evaluations are expensive, such as when they require human judgment or multiple LLM calls. We present the first systematic comparison of three optimization paradigms -- Elo tournament selection (RoboPhD), Pareto-based selection (GEPA), and greedy hill-climbing (Autoresearch) -- across four benchmarks spanning abstract reasoning, cloud scheduling, SQL generation, and financial QA, all under a fixed budget of 1,500 evaluations. RoboPhD introduces validation-free evolution: instead of splitting the budget between training and validation, it uses Elo competition on training data to simultaneously evaluate agents and drive evolution. All three systems receive seed agents with diagnostic print() statements that evolution can grow, enabling self-instrumenting agents that develop increasingly informative diagnostics for the benefit of their evolutionary successors. Using a single default configuration, RoboPhD outperforms both GEPA and Autoresearch on three of four benchmarks, losing only on the simplest task, where the winning solution (from our Autoresearch adaptation) required under 90 lines of code. On ARC-AGI, RoboPhD evolves a 22-line seed agent into a 1,013-line multi-strategy system, improving accuracy from 27.8% to 65.8% using Gemini 3.1 Flash Lite as the solver. We release RoboPhD as a versatile toolkit under the MIT license with a simple optimize_anything() API for evolving diverse complex agents.