SYNTHESIS NOTE
Topics›Evolution›this note

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.

Synthesis note · 2026-07-17 · sourced from Evolution

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 29

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.

Does evolutionary optimization at test time improve model performance effectively? Can AI agents learn to improve performance from experience? How bounded is recursive self-improvement in current AI systems? What external mechanisms enable reliable self-improvement in language models? How can model evaluations remain robust against gaming and evaluator drift? Do benchmark score improvements actually reflect genuine AI capability gains? How can agents learn and retain useful knowledge across diverse environments? Can we reliably detect when models engage in reward hacking? How can institutions effectively enforce controls on AI development? How do humans calibrate and maintain trust in AI systems? How does verifier integration affect the generation-verification gap?

Related concepts in this collection 3

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
13 direct connections · 94 in 2-hop network ·medium cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

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