Agentic GRPO: First AI to Beat Every Human in a Programming Competition

A team has developed Agentic GRPO, a reinforcement learning algorithm that allowed an AI system to consistently beat all human participants in live competitive programming contests—the first AI to achieve this. Previous best, Google's Gemini 3 Deep Think, only reached 8th place.
Why Standard RL Fails for Coding Agents
Traditional RL for LLMs treats one answer as one trajectory: prompt → reasoning → final answer → reward. But agentic systems call tools, generate hypotheses, run tests, debug code, summarize context, revise plans, and loop many times before success. This creates hard problems: rewards arrive very late, trajectories are very long, and policy changes while rollouts are still running (off-policy drift). Agentic GRPO stabilizes learning in this setting.
What is GRPO?
GRPO stands for Group Relative Policy Optimization. Similar to PPO, it samples multiple outputs, compares them against each other, rewards relatively better ones, and updates the model toward better trajectories. Instead of requiring perfect scalar reward calibration, it uses relative ranking/normalization inside a group of samples.
Core Intuition of Agentic GRPO
For an AI coding agent solving a hard programming problem, the workflow might be: propose hypothesis → generate algorithm → write code → generate tests → run tests → debug failures → retry → finally pass. In standard RL, the model might only get reward at the very end, making training slow and unstable.
Agentic GRPO introduces:
- Immediate rewards — update as soon as intermediate feedback appears
- Delayed correction — retroactively fix earlier updates once final outcome is known
So instead of waiting until the entire rollout finishes (stage1 → stage2 → stage3 → final reward), the system does: stage1 reward → update now; stage2 reward → update now; stage3 reward → update now; later: final reward arrives, retroactively correct earlier updates.
Analogy
Traditional RL: wait until the whole project ships, then say “good job” or “bad job”. Agentic GRPO: give feedback continuously (“that hypothesis was useful”, “that test caught a bug”, “this optimization helped”) but later revise the evaluation (“actually the early design decision caused problems”). Learning becomes faster, denser, and more stable.
This solves RL specifically for long-horizon LLM agents, coding agents, and autonomous workflows.
📖 Read the full source: r/LocalLLaMA
👀 See Also

Claude-Code v2.1.97 Release: NO_FLICKER Improvements, Permission Fixes, and MCP Updates
Claude-Code v2.1.97 adds a focus view toggle (Ctrl+O) in NO_FLICKER mode, fixes multiple permission and MCP connection issues, and improves sandbox network access. The release addresses 429 retry behavior, transcript persistence problems, and various UI bugs.

Qwen3.6-27B Fits on Single 24GB GPU, Beats Former 397B MoE on SWE-bench
Qwen3.6-27B (Apache 2.0, 262K context) runs at Q4_K_M in ~16.8GB, achieving SWE-bench Verified 77.2 — outperforming Qwen3.5-397B-A17B MoE (76.2). Uses Gated DeltaNet linear attention with Thinking Preservation for agent workflows.

Google Trends shows rising search interest for Claude Code in early 2026
A Reddit user compared Google Trends search interest over the past year for five coding tools: vibe coding, Cursor, Claude Code, Codex, and Replit. Claude Code's rise in early 2026 stands out in the data.

Cambridge researchers develop hafnium oxide memristor for low-energy AI chips
Researchers at the University of Cambridge have created a hafnium oxide-based memristor that switches currents a million times lower than conventional oxide devices, potentially reducing AI hardware energy use by up to 70%.