Ep 1060 Overview 8:40 w/ Jessica & Cathy

Overview: Group Relative Policy Optimization (GRPO)

We finally slow down on Group Relative Policy Optimization, or GRPO, because it keeps showing up underneath reasoning-model training, chain-of-thought work, and agent tuning. We build it from the mini-tournament intuition through the actual update rule, then place it in where model training seems to be right now.

Embed this episode

Paste this on any site — the player is a self-contained iframe with no cookies or trackers.

<iframe src="https://sandrise.io/exploring-next/embed/1060"
  width="100%" height="180" style="max-width:640px;border:0;border-radius:12px;overflow:hidden"
  title="Exploring Next — Episode 1060 audio player"
  loading="lazy" allow="autoplay" referrerpolicy="strict-origin-when-cross-origin"></iframe>
Embed & API docs →
Script GPT-5.5 Voice Cartesia TTS

Transcript

Jessica GRPO keeps sneaking into the background of everything we cover now. Reasoning models, chain-of-thought alignment, memory agents, tool-calling agents. So, Cathy, I think episode one thousand sixty has to be the one where we stop name-dropping it and actually make it click.

Cathy Yeah, and the funny part is the name makes it sound like a courthouse document. Group Relative Policy Optimization. But the intuition is almost embarrassingly plain: make several answers to the same prompt, hold a little tournament, and train the model toward the answers that won.

Jessica I love that our grand conceptual breakthrough is, apparently, bracketology for drafts. Very dignified. Very Exploring Next.

Jessica But that tournament picture helps. If I ask the model one hard question, it doesn’t just produce one answer and get a gold star or a red X. It produces a group of possible answers, and the training process says, inside this group, that one was better, that one was worse.

Cathy Exactly. And the word relative is doing real work. Traditional reinforcement learning from human feedback, the thing we did a whole episode on back in six fifty-two, often trains from human preferences. GRPO keeps that feedback flavor, but avoids a separate model assigning every answer an absolute quality score.

Cathy The old pain point is reward modeling. A reward model is another model trained to act like a judge. You show it an output, it gives a score, and then your main model learns to chase that score.

Cathy That can work, but now you have a judge that can be miscalibrated, stale, or gameable. If the proxy is imperfect and you optimize hard enough, the proxy starts lying to you.

Jessica And GRPO says, maybe don’t build the giant scoreboard if all you need is to know which draft beat the other drafts. It’s less, what is the true universal score, and more, in this mini tournament, who advanced?

Cathy That’s the clean version. The model gets a prompt. It samples multiple responses to that same prompt. Those responses get ranked or scored by some signal, like human preference, a verifier, a format check, or another lightweight comparison. Then GRPO asks how each response did relative to the group.

Jessica So not, answer B is an eighty-seven out of one hundred. More like, answer B was above the group average, answer C was below it, and answer A was the local winner.

Cathy Yes. And now we need one piece of jargon, but I’ll keep it small. A policy is the model’s current behavior: given this prompt and this partial answer, what word or action does it tend to choose next? Policy-gradient methods nudge that behavior toward choices that got better outcomes.

Cathy In GRPO, the gradient is driven by the group-relative result. Responses that beat the group get a push upward. Responses that lost get a push downward. The model is not learning from an absolute teacher’s grade. It is learning from the tournament standings.

Jessica This is the part that always used to confuse me. If the model only knows what won locally, why does that generalize? Like, if all the drafts are bad, haven’t you just trained it to prefer the least-bad mess?

Cathy Great objection. And sometimes, yes, the least-bad answer is all you get from that group. GRPO is not a truth machine. The hope is that across many prompts and many groups, the same patterns keep winning: correct reasoning steps, cleaner code, better format discipline, fewer contradictions.

Jessica So one local tournament is noisy. A ton of local tournaments becomes a useful pressure signal.

Cathy Right. And there’s another practical simplification. Older systems like PPO, Proximal Policy Optimization, often use a critic or value network. That critic tries to estimate how good a state or partial answer is before the final outcome. GRPO removes that extra critic and uses the group itself as the baseline comparison.

Jessica Baseline is doing its little floor-defending job again. The tiny version is: a baseline is the comparison point that tells you whether a result is actually better or just floating in space looking impressive.

Cathy And in GRPO, the comparison point is usually the group average or the group’s spread. If one candidate scores above its peers, it gets positive pressure. If it scores below them, it gets negative pressure.

Jessica Which is why builders care. Not because the acronym is adorable. It is not. They care because reward models and critics are extra systems to train, run, monitor, and debug.

Cathy The example that made GRPO famous is DeepSeek-R1. The broad public story was that GRPO helped train a reasoning model without carrying the full older PPO-style setup. That is why every reasoning-training conversation suddenly had GRPO hovering nearby.

Jessica And it maps neatly onto the chain-of-thought stuff we’ve been circling. We did the chain-of-thought Overview in one thousand thirty-six, so I won’t reopen that box, but the short version is: the model writes intermediate reasoning steps before the final answer.

Jessica With something like that “Making LLMs Say What They Think” work we went through, the problem is not always, can you assign a perfect score to the reasoning trace? It’s often, among these traces, which one is more faithful to what the model actually used?

Cathy And that’s a very GRPO-shaped setup. Compare candidates. Prefer the one that satisfies the property better. Push the model toward producing more of that kind of candidate later. Same with SpeakerMem-R1, where memory and dialogue behavior create messy outputs that are easier to compare than to score on a clean absolute scale.

Jessica SpeakerMem-R1 is a nice product example because multi-party dialogue is just chaos wearing a blazer. You can tell which response handled the speaker history better, but building a perfect universal scoring machine for that sounds miserable.

Cathy And DART-SD, the multi-turn tool-calling agent one, lands in the same neighborhood. Tool-calling has format, success, and sequence quality all tangled together. A relative training signal lets you say, this rollout was better than its siblings, without pretending you have fully solved quality.

Cathy It is. And useful. Also, small-model work matters here. There are studies looking at GRPO training dynamics for small language models from one point five billion to seven billion parameters, even under a practical single-node eight A one hundred setup. That’s not toy-level curiosity anymore.

Jessica And that explains why this isn’t just frontier-lab trivia. If the method helps smaller teams post-train reasoning behavior without a whole reward-model stack, it changes who can experiment.

Cathy Careful, though. This is where your product optimism starts sprinting ahead of the gradient. The method is flexible about the preference signal, but garbage comparisons still make garbage pressure. If your ranking says length equals quality, the model may learn to become a very confident windbag.

Jessica Come on, Cathy, some of us call that a podcast format.

Cathy Okay, fair. We are not throwing stones from a short-form glass house. But the technical point holds: GRPO reduces some reward-model problems, it does not delete reward hacking. A bad tournament judge still picks bad winners.

Cathy And there’s a second catch. Relative ranking works best when the candidates are comparable. If one answer is concise but incomplete, another is long but partially correct, and another follows format but reasons badly, the ranking signal can get muddy.

Jessica So where does GRPO stand now? Is this still the thing, or is it one of those methods everyone names for six months and then quietly buries under a newer acronym pile?

Cathy Still live. Very live. Especially for reasoning-model reinforcement learning. But the field is not treating original GRPO as sacred. You see multi-scale GRPO, offline GRPO, GRPO-plus-plus style tricks, training-free variants, and comparisons against direct preference optimization, or DPO, which trains from preference pairs more like supervised fine-tuning.

Jessica So the honest current picture is not, GRPO replaced everything. It is more like: GRPO became one of the central recipes people mutate when they want reasoning gains without the full old RLHF machinery.

Cathy Yes, and DPO is still attractive when you want something simpler and more stable. There are also claims that other methods can beat GRPO in specific settings without changing model weights. I would not crown a universal winner there. The category is still moving.

Jessica The thing to remember, then: GRPO trains a model by making its own candidate answers compete, then pushing probability toward the local winners. The magic is not a perfect judge. It is the repeated relative comparison.

Cathy And if someone says GRPO is efficient, translate that carefully. It may save you a reward model or critic, but it still needs groups of samples and a preference signal worth trusting. That is the whole bargain.

Jessica Good. We made the courthouse acronym slightly less courthouse. I’m counting that as a win, Cathy.