Jul 2026· 2026 6th International Conference on Electrical, Computer and Energy Technologies (ICECET)· pp. 1-6· 0 citations· 11 references
Abstract
Proximal Policy Optimization (PPO) is widely used in reinforcement learning because it provides stable on-policy learning with relatively simple implementation. However, standard PPO uses a fixed clipping threshold, applying the same trust-region width to all training samples even though the reliability of policy updates may vary across states and actions. This paper studies a family of adaptive-clipping PPO variants that replace the constant clipping parameter with sample-dependent thresholds derived from policy and return statistics. We introduce Dual-Adaptive Z-Score PPO (PPO-DAZ3), which dynamically adjusts the clipping interval using two signals: action confidence, derived from the probability of the selected action under the current policy, and update confidence, measured from normalized advantage magnitude. This formulation enables persample adaptation while preserving the standard PPO training pipeline. Experiments on three classic reinforcement learning benchmarks-LunarLander-v3, CartPole-v1, and Acrobotv1-show that adaptive clipping can improve learning performance in some environments. PPO-DAZ3 achieved the strongest results on LunarLander-v3, while the smooth advantage-based variant PPO-AZ3S performed best on Acrobotv1. On CartPole-v1, standard PPO remained competitive, indicating that adaptive clipping is most beneficial on more challenging control tasks.
Group Adaptive Clipping Policy Optimization (GAPO), a plug-in modification to GRPO methods that adapts the clipping boundary to the rollout advantage, is proposed, motivated by a reverse-KL trust-region perspective, which suggests that rollouts with larger learning signal should receive proportionally greater update he...
Sheng Jia, Xiao Wang, S. Kasiviswanathan et al.· 0 citations
Proximal Policy Optimization (PPO) for large language models typically trains its critic by mean-squared-error (MSE) regression on scalar value targets. Although scalar MSE is statistically valid for estimating the conditional expected return, sparse binary rewards in reinforcement learning with verifiable rewards (RLV...
Zhi-Jian Zhou, Long Li, Xuan Zhang et al.· 2 citations· ⚡2
PPO and the GRPO baseline studied here use clipped surrogate objectives whose favorable-direction saturation introduces an abrupt change in the scalar objective's derivative. We ask whether Output Reset (OR), a smooth one-sided saturation rule, offers a useful alternative for large language model post-training. PPO-OR...
Chinmay Rane, Kanishka Tyagi, Michael T. Manry· arXiv.org· 0 citations
DIEM is proposed, a principled and fully automated framework that makes data utilization adaptive throughout RFT and consistently outperforms strong static and dynamic baselines.
Haoru Tan, Sitong Wu, Yan-Feng Chen et al.· 0 citations
This paper introduces a novel reward-model-free, critic-free, and gradient-based PbRL algorithm compatible with segment preferences named Segment Pairwise Proximal Policy Optimization (SP3O), and provides a theoretical basis for the algorithm and analyze the tradeoff in choosing the segment length.
Best Practice Critic Optimization (BPCO) is developed, a recipe that combines DPPO, value predictions bounded to the reward range, Monte Carlo value targets, unnormalized policy advantages, and length-adaptive generalized advantage estimation and shows that a carefully designed critic provides a reliable alternative to...