用搜索方法融合偏好与专家示范,提升离线强化学习的信用分配精度。
Search-Based Credit Assignment for Offline Preference-Based Reinforcement Learning
- 通过搜索相似状态动作对,为偏好数据生成逐步重要性权重。
- 在机器人操作任务中显著优于仅用偏好或示范的方法。
- 适合需要结合人类反馈与专家数据的复杂控制场景。
离线强化学习从固定数据集学习策略,无需额外环境交互,但通常依赖精心设计的奖励函数,而这类函数难以且昂贵地构建。人类反馈是替代方案,但专家示范和偏好两种形式各有局限:示范提供逐步监督,但收集成本高且行为模式有限;偏好更易获取,却无法确定行为片段中哪部分贡献最大,导致信用分配模糊。本文提出基于搜索的偏好加权(SPW)方法,统一两种反馈。对每条带偏好标签轨迹中的每个转移,SPW搜索最相似的专家示范状态-动作对,并基于相似度得分直接推导出逐步重要性权重。这些权重用于指导标准偏好学习,实现更精确的信用分配,传统方法难以达成。实验表明,SPW能有效联合利用偏好与示范,在挑战性的机器人操控任务中超越先前同时使用两类反馈的方法。
原文摘要 · Abstract (English)
Offline reinforcement learning refers to the process of learning policies from fixed datasets, without requiring additional environment interaction. However, it often relies on well-defined reward functions, which are difficult and expensive to design. Human feedback is an appealing alternative, but its two common forms, expert demonstrations and preferences, have complementary limitations. Demonstrations provide stepwise supervision, but they are costly to collect and often reflect limited expert behavior modes. In contrast, preferences are easier to collect, but it is unclear which parts of a behavior contribute most to a trajectory segment, leaving credit assignment unresolved. In this paper, we introduce a Search-Based Preference Weighting (SPW) scheme to unify these two feedback sources. For each transition in a preference labeled trajectory, SPW searches for the most similar state-action pairs from expert demonstrations and directly derives stepwise importance weights based on their similarity scores. These weights are then used to guide standard preference learning, enabling more accurate credit assignment that traditional approaches struggle to achieve. We demonstrate that SPW enables effective joint learning from preferences and demonstrations, outperforming prior methods that leverage both feedback types on challenging robot manipulation tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。