Replace PPO's heuristic ratio-based clipping with Divergence Proximal Policy Optimization (DPPO) that directly constrains policy divergence using either Total Variation or KL, enabling lightweight approximations (Binary, Top-K) for vocabulary-scale computations while improving stability and efficiency.
Replace PPO's heuristic ratio-based clipping with Divergence Proximal Policy Optimization (DPPO) that directly constrains policy divergence using either Total Variation or KL, enabling lightweight approximations (Binary, Top-K) for vocabulary-scale computations while improving stability and efficiency.
DPPO: Direct Divergence Constraints for Stable LLM RL
PPO's probability ratio clipping creates problematic asymmetries in LLM training: low-probability tokens trigger aggressive clipping despite negligible distributional impact, while high-probability tokens shift substantially without penalty. DPPO replaces heuristic ratio clipping with direct divergence constraints, measuring actual policy divergence rather than noisy single-sample estimates. Lightweight approximations enable vocabulary-scale divergence computation.
Core Concept
The key insight is that PPO's mechanism is fundamentally misaligned with LLM training objectives. PPO uses token-level probability ratios as proxies for policy divergence, but these are noisy single-sample estimates that don't reflect true distributional differences. DPPO directly measures divergence (Total Variation or KL) between old and new policies, constraining whether the entire distribution has shifted too far rather than penalizing individual tokens.
Architecture Overview
Direct Divergence Measurement: Compute actual policy divergence rather than probability ratios
Lightweight Approximations: Binary (Bernoulli) and Top-K approximations for efficient divergence estimation
Vocabulary-Scale Feasibility: Avoid expensive full-vocabulary KL computation via smart approximations
Asymmetry-Free Updates: Uniform penalty structure regardless of token probability
Joint Optimization: Train both policy and reward model with aligned divergence constraints
Implementation
Step 1: Understand PPO's Ratio-Based Clipping Problem
Analyze why probability ratios are problematic for policy divergence control.
Binary/Top-K approximate while remaining efficient
Divergence Limit
0.01-0.1
Lower = tighter constraint; task-dependent
Approximation
Top-K for large vocab, Binary for simplicity
Top-K better preserves probability mass
K Value
10-50 tokens
Trade-off between accuracy and computation
Comparison to PPO
Typically 10-20% stability improvement
DPPO avoids asymmetric penalty structure
When to Use:
LLM RL training where PPO stability is problematic
Scenarios with sparse reward signals (divergence constraints help)
Models with large vocabularies (approximations become essential)
When Not to Use:
Well-tuned PPO with careful hyperparameter selection
Small vocabulary tasks (ratio-based methods may be sufficient)
Systems requiring extremely tight divergence control (need full KL)
Reference
Demonstrates superior stability and efficiency compared to GRPO and other baselines across multiple model sizes and tasks, with lightweight approximations enabling vocabulary-scale divergence computation.