Agon: Two Models Grading Each Other Replace Process Labels
Two models grade each other's work and double GRPO's pass@1 on math and coding benchmarks — with zero process labels and no reward model. The catch shows up when you try to ship it.

Automation needs a narrow first win
The best first AI workflow is usually a repeated task with a clear input, clear output, and a human approval step.
Agon is a reinforcement learning framework where two models grade each other's work — no process labels, no reward model, just a drafter and a grader trading roles until reasoning improves. That trade alone is worth paying attention to, because the expensive part of training reasoning models has always been labeling the reasoning itself.
How the Two-Model Loop Works
The setup is simple enough to reason about before you trust it. Two competing models alternate between drafting solutions and grading each other's attempts. The grading signal happens implicitly during training — nobody writes out step-by-step process labels, and there's no separately trained reward model scoring outputs. The models' disagreement does the work.
At inference time, the framework deploys as a two-stage cascade: one model drafts, the other answers after reading that draft. That's a deployable shape, not just a training trick, which matters more than it sounds — most RL results die the moment you try to ship them.

Worth a look
Phugialy Picks

AI Engineering: Building Applications with Foundation Models
A practical guide to building real-world applications with foundation models and LLMs.

GMKtec K15 AI Mini PC Oculink Intel Ultra 5 125U 32GB DDR5 512GB SSD | Desktop Computer AI Boost, 3X M.2 2280 Storage Expansion, Dual NIC...

AI: Understand the Revolution: From Basics and Buzzwords to Tech Giants, Governments, and Your Future
Some Phugialy Picks use affiliate links. If you buy through one, Phugialy may earn a commission. It doesn't change what we recommend. Full disclosure →
What the Numbers Actually Show
On mathematical and coding benchmarks, Agon doubles GRPO's pass@1, and delivers roughly eight times the gain of an untrained Mixture-of-Agents pass over the same base model. The gains replicate across Qwen3.5, Gemma 4, and competitive programming code — replication across model families is the part I'd trust most here, since single-model RL wins routinely fail to transfer.
The stated next step is letting models reason together in latent space. That's ambitious, but it's also where I'd temper expectations: latent-space collaboration between two models is a much harder systems problem than alternating roles on text.
Where This Reinforcement Learning Framework Gets Annoying in Practice
The interesting question isn't whether the benchmark numbers hold — it's what happens when you're the one integrating this. A two-stage cascade means two models to host, two inference paths to monitor, and latency that scales with both stages instead of one. If your grader drifts or gets weaker than your drafter over time, you've built a feedback loop with no obvious failure alarm.
There's also an open question about domain coverage. The evidence here is math and competitive programming — domains where correctness is checkable even implicitly. Whether implicit grading holds up on messier tasks where 'good reasoning' is contested is exactly what the source doesn't tell us.
My read: this is the missing piece for teams who want reasoning gains without hiring annotators to write process labels — if cascade latency and grader stability don't get in the way. The part worth trying yourself is the inference-time cascade first; you can test whether a second model reading a draft actually improves your outputs before committing to any training run at all.

Got a question about how this applies to you? →
Keep reading
Follow the thread
Soft Robot Policy Learning Just Got Up To 40x Faster
A 40x speedup in simulation training sounds like a lab curiosity until you price what simulation time actually costs. New research on soft robot policy learning reports that switching to implicit time-stepping cuts train
Read this noteSame lane, different angle
Soft Robot Policy Learning Gets Up To 40x Faster
Soft robot policies just trained up to 40x faster in contact-heavy tasks - no new hardware required. The fix was making each simulation step structurally cheaper instead of buying more compute.
In-Context Search: Why LLM Retry Loops Actually Work
Why does a language model sometimes get the right answer on its second try after failing on its first? A recent theoretical paper offers an answer: the model isn't just "trying again" - it's doing something that looks a