Can evaluators improve alongside the agents they score?
Most self-improving systems rely on a fixed benchmark or verifier that doesn't change. But what if the evaluator itself learned and adapted as the agent improved? This explores whether co-evolution unlocks tasks that resist static scoring.
Self-improving agents have always assumed a stationary yardstick — a fixed verifier, benchmark, or labeled dataset that stays valid as the agent gets stronger. The Red Queen Gödel Machine breaks that assumption by making the evaluator part of the improvement loop, co-evolving learned evaluators alongside the task agents they score. This matters because a whole class of valuable tasks has no direct benchmark: paper writing and proof writing cannot be scored the way paper reviewing and proof grading can. Since Can AI systems improve themselves through trial and error? circumvented the formal-proof requirement but still leaned on an external utility signal, RQGM addresses the residual weakness — that external signal is itself static and eventually mis-scores an improving population.
The mechanism is controlled utility evolution: search runs in epochs with a fixed within-epoch criterion, so per-epoch self-improvement guarantees still hold, but the utility updates at epoch boundaries. Therefore the objective can strengthen without breaking the formal loop. The reported payoff is not just reach onto ungradable tasks but token efficiency — co-evolved systems match or beat fixed-evaluator baselines while spending fewer tokens, which the authors attribute to shared expansion costs and a curriculum-like hardening: a progressively stricter evaluator pressures the population over time. This is the generator-verifier gap turned dynamic — the verifier no longer sits outside the loop as a ceiling but climbs with the generator.
Inquiring lines that read this note 19
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
What fundamental constraints limit how effectively agents can improve themselves?- What makes evolving the benchmark different from evolving the optimizer itself?
- How does controlled utility evolution prevent the evaluator from becoming a new bottleneck?
- Can a progressively stricter evaluator act like a curriculum for improving agents?
- How do epoch boundaries preserve self-improvement guarantees across objective changes?
- What makes an evaluation criterion non-stationary enough to resist agent optimization?
- What makes a self-improvement win untrustworthy and why hide evaluations from agents?
- Does fixed evaluation criteria saturate as self-improving agents improve?
- Does co-evolution empirically outperform single-entity self-improvement in standard evaluations?
- What makes an agent in an economic simulation self-evolving?
- Can agents improve reliably without an external standard?
- Do evolutionary archives let agents improve themselves without formal proof?
Related concepts in this collection 3
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Can AI systems improve themselves through trial and error?
Explores whether replacing formal proof requirements with empirical benchmark testing enables AI systems to successfully modify and improve their own code iteratively, and what mechanisms prevent compounding failures.
RQGM extends DGM by removing the *static external utility* that DGM still depended on
-
Can machine feedback sustain discovery at test time?
Can LLMs paired with automated evaluators discover genuinely novel solutions through iterative refinement, rather than just generating hypotheses? This matters because it tests whether autonomous research scales beyond benchmarks to real deployed innovations.
grounds the value of automated evaluators; RQGM makes those evaluators themselves improve
-
Can AI systems improve their own learning strategies?
Current self-improvement relies on fixed human-designed loops that break when tasks change. The question is whether agents can develop their own adaptive metacognitive processes instead of depending on human intervention.
co-evolving evaluators is one way to loosen the fixed-loop dependency this note flags
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- The Red Queen Gödel Machine: Co-Evolving Agents and Their Evaluators
- Hyperagents
- Self-Improvements in Modern Agentic Systems: A Survey
- Co-Evolution in Agentic Systems: Toward Self-Directed Evolution Beyond Human Design
- Generalized Agent Iteration: One Formal Framework for Iterative Policy Improvement and Recursive Self-Improvement
- Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents
- Aspire: Can Models Self-Evolve from Vague Goals?
- DarwinX: Evolving Agent Harnesses Through Natural Selection
Original note title
co-evolving the evaluator with the agent extends recursive self-improvement to hard-to-verify tasks where no fixed benchmark can score the artifact