← Latest papers
🤖 machine learning

Sharpness-Guided Group Relative Policy Optimization via Probability Shaping

This paper proposes Sharpness-Guided GRPO (GRPO-SG), a token-weighted variant of Group Relative Policy Optimization that improves generalization in reinforcement learning with verifiable rewards by downweighting tokens causing large gradients to reduce sharpness and stabilize training.

Original authors: Tue Le, Linh Ngo Van, Trung Le

Published 2026-05-14
📖 4 min read☕ Coffee break read

Original authors: Tue Le, Linh Ngo Van, Trung Le

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are teaching a very smart student (a Large Language Model) how to solve difficult puzzles, like math problems or logic riddles. You don't give them a teacher to grade every single step; instead, you give them a "checklist" at the end. If the final answer is correct, they get a gold star (a reward). If it's wrong, they get nothing. This is called Reinforcement Learning with Verifiable Rewards (RLVR).

Currently, the most popular way to teach this student is a method called GRPO. Think of GRPO as a coach who says, "Okay, let's try 5 different ways to solve this problem. The ones that got the gold star are good; the ones that failed are bad. Let's adjust the student's brain to be more like the winners and less like the losers."

The Problem: The "Over-Excited" Student

The paper argues that while GRPO works well, it can sometimes be a bit too aggressive. Imagine the student is trying to learn. When they make a mistake on a specific word or step, the coach might yell very loudly to correct them. In math terms, this creates a "sharp" update—a huge, jarring change to the student's brain.

While this might fix the immediate mistake, it can make the student unstable. They might forget how to solve similar problems they used to know, or they might overreact to tiny details that don't matter. In the paper's language, this is called high sharpness, which leads to poor generalization (the ability to handle new, unseen problems).

The Solution: The "Confidence Meter" (GRPO-SG)

The authors propose a new method called GRPO-SG (Sharpness-Guided GRPO).

Here is the simple analogy:
Imagine the student is writing a story.

  • High-Confidence Words: These are words the student is 100% sure of, like "the" or "and," or crucial math symbols like "+" or "=". The student knows these are vital for the sentence to make sense.
  • Low-Confidence Words: These are words the student is guessing at, like a fancy adjective or a specific number they aren't sure about.

In the old method (GRPO), if the student guessed a low-confidence word and got it wrong, the coach would scream, "NO! Change your whole brain!" This causes a huge, "sharp" update that might break other things.

GRPO-SG acts like a wise coach who looks at the student's "confidence meter" before yelling.

  • If the student is unsure (low confidence) and makes a mistake, the coach whispers, "Okay, let's try to be a little more careful next time," but doesn't make a huge change. This prevents the student from panicking and over-correcting.
  • If the student is sure (high confidence) and gets it right, the coach gives a strong, positive nudge to reinforce that good habit.

How It Works (The "Probability Shaping")

The paper uses a mathematical trick called Probability Shaping.

  1. The system checks how confident the model is about the word it just picked (based on the "logit," which is just a score of how likely that word is).
  2. If the score is low (the model is guessing), the system downweights the lesson. It says, "Don't let this one mistake shake your whole foundation."
  3. If the score is high (the model is confident), the system upweights the lesson. It says, "This is a solid move; let's make sure we keep doing it."

The Results: Smoother Riding

The paper tested this new method on three types of challenges:

  1. Math: Solving Olympiad-level math problems.
  2. Logic: Solving "Knights and Knaves" puzzles (where some people always lie and some always tell the truth).
  3. Tool Use: Asking the AI to use a search engine to find answers.

What happened?

  • Better Scores: The new method (GRPO-SG) consistently got higher scores than the old method (GRPO) on all these tests. For example, on logic puzzles, the success rate jumped significantly.
  • Smoother Learning: If you watched the "gradient norm" (a measure of how violently the student's brain was changing), the new method was much smoother. It didn't have those wild spikes of over-correction. It was a steady, calm ride to the top.

Summary

The paper claims that by simply telling the AI to ignore the "panic" of low-confidence guesses and focus on reinforcing high-confidence moves, we can train smarter, more stable, and more generalizable reasoning models. It's like teaching a student to trust their gut on what they know and not to freak out over the things they are still guessing.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →