Improving Reward Models with Proximal Policy Exploration for Preference-Based Reinforcement Learning
Yiwen Zhu, Jinyi Liu, Pengjie Gu, Yifu Yuan, Zhenxing Ge, Wenya Wei, Zhou Fang, Yujing Hu, Bo An
Reinforcement learning (RL) heavily depends on well-designed reward functions, which are often biased and difficult to design for complex behaviors. Preference-based RL (PbRL) addresses this by learning reward models from human feedback, but its practicality is constrained by a critical dilemma: while existing methods reduce human effort through query optimization, they neglect the preference buffer's restricted coverage  —a factor that fundamentally determines the reliability of reward model. We systematically demonstrate this limitation creates distributional mismatch: reward models trained on static buffers reliably assess in-distribution trajectories but falter with out-of-distribution (OOD) trajectories from policy exploration. Crucially, such failures in policy-proximal regions directly misguide iterative policy updates.To address this, we propose **Proximal Policy Exploration (PPE)** with two key components:(1) a *proximal-policy extension* method that expands exploration in undersampled policy-proximal regions, and(2) a *mixture distribution query*  method that balances in-distribution and OOD trajectory sampling.By enhancing buffer coverage while preserving evaluation accuracy in policy-proximal regions, PPE enables more reliable policy updates.Experiments across continuous control tasks demonstrate that PPE enhances preference feedback utilization efficiency  and RL sample efficiency over baselines, highlighting preference buffer coverage management's vital role in  PbRL.