SENIOR: Efficient Query Selection and Preference-Guided Exploration in Preference-based Reinforcement Learning
This work addresses efficiency bottlenecks in PbRL for robot manipulation, offering incremental improvements over prior methods.
The paper tackles the poor feedback- and sample-efficiency in Preference-based Reinforcement Learning by introducing SENIOR, a method that selects meaningful behavior segment pairs and uses preference-guided exploration, resulting in outperforming five existing methods on six robot manipulation tasks in simulation and real-world settings.
Preference-based Reinforcement Learning (PbRL) methods provide a solution to avoid reward engineering by learning reward models based on human preferences. However, poor feedback- and sample- efficiency still remain the problems that hinder the application of PbRL. In this paper, we present a novel efficient query selection and preference-guided exploration method, called SENIOR, which could select the meaningful and easy-to-comparison behavior segment pairs to improve human feedback-efficiency and accelerate policy learning with the designed preference-guided intrinsic rewards. Our key idea is twofold: (1) We designed a Motion-Distinction-based Selection scheme (MDS). It selects segment pairs with apparent motion and different directions through kernel density estimation of states, which is more task-related and easy for human preference labeling; (2) We proposed a novel preference-guided exploration method (PGE). It encourages the exploration towards the states with high preference and low visits and continuously guides the agent achieving the valuable samples. The synergy between the two mechanisms could significantly accelerate the progress of reward and policy learning. Our experiments show that SENIOR outperforms other five existing methods in both human feedback-efficiency and policy convergence speed on six complex robot manipulation tasks from simulation and four real-worlds.