PapersWithELO
← ICLR 2024 leaderboard

On Stationary Point Convergence of PPO-Clip

Ruinan Jin, Shuai Li, Baoxiang Wang

reinforcement learningPPOPPO-Clipstochastic optimization
83.10100
Fused
band ≈ ±15 pct pts (from σ = 0.31)
80.90100
Mimo
band ≈ ±22 pct pts (from σ = 0.44)
77.20100
DeepSeek
band ≈ ±22 pct pts (from σ = 0.44)

OpenReview ground truth

Accepted

TL;DR — We provide a comprehensive analysis that shows the stationary point convergence of PPO-Clip and the convergence rate thereof.

Abstract

Proximal policy optimization (PPO) has gained popularity in reinforcement learning (RL). Its PPO-Clip variant is one the most frequently implemented algorithms and is one of the first-to-try algorithms in RL tasks. This variant uses a clipped surrogate objective function not typically found in other algorithms. Many works have demonstrated the practical performance of PPO-Clip, but the theoretical understanding of it is limited to specific settings. In this work, we provide a comprehensive analysis that shows the stationary point convergence of PPO-Clip and the convergence rate thereof. Our analysis is new and overcomes many challenges, including the non-smooth nature of the clip operator, the potentially unbounded score function, and the involvement of the ratio of two stochastic policies. Our results and techniques might share new insights into PPO-Clip.

Author context

Most prolific author: 9 submissions (credibility 0.86).

No mass-submission penalty for this paper (authors within normal submission volume).

Aggregate statistics only — no individual author rankings.

Ranking trajectory

Percentile by tournament round — convergence indicates rating stability.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 34)