用大模型实现少样本情境偏好学习,显著提升效率与效果。
ICPL: Few-shot In-context Preference Learning via LLMs
- 利用大模型上下文学习能力,通过人类反馈迭代优化奖励函数。
- 相比基线方法,性能更高且效率提升数个数量级。
- 在真实人类参与场景中仍有效,适合人机协同强化学习任务。
基于偏好的强化学习在奖励难以明确指定的任务中表现良好,但偏好学习常从零开始,效率低下。我们证明大型语言模型(LLMs)具备原生的偏好学习能力,可实现高效的样本利用。为此提出情境偏好学习(ICPL),利用LLM的上下文学习能力减少人工查询开销。ICPL通过任务描述和基础环境代码生成奖励函数集,将策略运行视频与人类反馈放入LLM上下文,迭代请求更优奖励。在合成偏好研究中,定量验证了ICPL显著优于基线方法,性能更高且效率提升数个数量级。观察发现,性能提升不仅源于任务上下文对齐,还因奖励质量随时间改善,体现偏好学习能力。此外,在一系列真实人类偏好学习实验中,ICPL在真实人机协作场景中同样有效。
原文摘要 · Abstract (English)
Preference-based reinforcement learning is an effective way to handle tasks where rewards are hard to specify but can be exceedingly inefficient as preference learning is often tabula rasa. We demonstrate that Large Language Models (LLMs) have native preference-learning capabilities that allow them to achieve sample-efficient preference learning, addressing this challenge. We propose In-Context Preference Learning (ICPL), which uses in-context learning capabilities of LLMs to reduce human query inefficiency. ICPL uses the task description and basic environment code to create sets of reward functions which are iteratively refined by placing human feedback over videos of the resultant policies into the context of an LLM and then requesting better rewards. We first demonstrate ICPL's effectiveness through a synthetic preference study, providing quantitative evidence that it significantly outperforms baseline preference-based methods with much higher performance and orders of magnitude greater efficiency. We observe that these improvements are not solely coming from LLM grounding in the task but that the quality of the rewards improves over time, indicating preference learning capabilities. Additionally, we perform a series of real human preference-learning trials and observe that ICPL extends beyond synthetic settings and can work effectively with humans-in-the-loop.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。