Table of Contents
Fetching ...

It's Not You, It's Clipping: A Soft Trust-Region via Probability Smoothing for LLM RL

Madeleine Dwyer, Adam Sobey, Adriane Chapman

TL;DR

PSPO addresses the instability and information loss caused by ratio clipping in RL for LLM fine-tuning by introducing probability smoothing that blends the current policy with the behaviour policy, creating a soft trust region. The method yields a simple, drop-in replacement for clipping with a single hyperparameter $\alpha$, while preserving gradients and implicitly shrinking KL and TV distance to the behaviour policy. Empirically, GR-PSPO outperforms GRPO-clip and sigmoid-based alternatives, with pronounced gains on math-focused and larger models, exemplified by $79.9\%$ GSM8K and $59.6\%$ MATH on Qwen2-Math-1.5B at $T=0$. The results imply that stability-aware refinement of knowledge-rich models benefits most from probability smoothing, supporting its practical adoption in post-SFT RL pipelines for LLMs.

Abstract

Training large language models (LLMs) with reinforcement learning (RL) methods such as PPO and GRPO commonly relies on ratio clipping to stabilise updates. While effective at preventing instability, clipping discards information, introduces gradient discontinuities and can prevent exploration of better policies. Inspired by label smoothing, we propose Probability Smoothing Policy Optimisation (PSPO). PSPO smooths current policy probabilities toward the behaviour policy before computing importance ratios, creating a soft trust region that preserves gradients while preventing destabilising updates. Unlike prior soft clipping approaches that use sigmoid-based transformations which can suffer from vanishing gradients and saturation, our method uses a linear interpolation, providing simpler and more robust gradient preservation. Empirically, GR-PSPO outperforms clipping and sigmoid-based alternatives on mathematical reasoning benchmarks when refining models with prior domain knowledge, achieving an accuracy of 79.9% on GSM8K and 59.6% on MATH for Qwen2-Math-1.5B.

It's Not You, It's Clipping: A Soft Trust-Region via Probability Smoothing for LLM RL

TL;DR

PSPO addresses the instability and information loss caused by ratio clipping in RL for LLM fine-tuning by introducing probability smoothing that blends the current policy with the behaviour policy, creating a soft trust region. The method yields a simple, drop-in replacement for clipping with a single hyperparameter , while preserving gradients and implicitly shrinking KL and TV distance to the behaviour policy. Empirically, GR-PSPO outperforms GRPO-clip and sigmoid-based alternatives, with pronounced gains on math-focused and larger models, exemplified by GSM8K and MATH on Qwen2-Math-1.5B at . The results imply that stability-aware refinement of knowledge-rich models benefits most from probability smoothing, supporting its practical adoption in post-SFT RL pipelines for LLMs.

Abstract

Training large language models (LLMs) with reinforcement learning (RL) methods such as PPO and GRPO commonly relies on ratio clipping to stabilise updates. While effective at preventing instability, clipping discards information, introduces gradient discontinuities and can prevent exploration of better policies. Inspired by label smoothing, we propose Probability Smoothing Policy Optimisation (PSPO). PSPO smooths current policy probabilities toward the behaviour policy before computing importance ratios, creating a soft trust region that preserves gradients while preventing destabilising updates. Unlike prior soft clipping approaches that use sigmoid-based transformations which can suffer from vanishing gradients and saturation, our method uses a linear interpolation, providing simpler and more robust gradient preservation. Empirically, GR-PSPO outperforms clipping and sigmoid-based alternatives on mathematical reasoning benchmarks when refining models with prior domain knowledge, achieving an accuracy of 79.9% on GSM8K and 59.6% on MATH for Qwen2-Math-1.5B.

Paper Structure

This paper contains 26 sections, 5 theorems, 15 equations, 1 figure, 8 tables.

Key Result

Lemma 2.1

For any state $s$ and $\alpha\in[0,1]$,

Figures (1)

  • Figure 1: Illustrative plot of ratio $r$ vs. the surrogate term $A$, and the gradients for $A>0$ and $A<0$, with $\varepsilon = 0.2$ and $\alpha = 0.2$. For $A > 0$ the clipped ratio is flat (zero gradient) for $r > 1 + \varepsilon$; for $A < 0$, the clipped ratio is flat when $r < 1 - \varepsilon$. PSPO's slope is $(1-\alpha)A$ everywhere, creating a soft trust region without hard plateaus.

Theorems & Definitions (7)

  • Lemma 2.1: Total variation (TV) contraction
  • proof
  • Corollary 2.2: KL upper bounds shrink under smoothing
  • Proposition 2.3: Ratio contraction and non-vanishing slopes
  • Proposition 2.4: Overconfidence regularisation
  • proof
  • Proposition 2.5: PSPO surrogate as a scaled policy gradient with implicit stability