用大模型自动拆解复杂操作任务,让强化学习更高效。
LEACL: LLM-Enhanced Automatic Curriculum Learning for Reinforcement Learning in Long-Horizon Manipulation Tasks

- 用大模型分解任务并生成训练参数,无需人工设计奖励函数。
- 在五个长时序操作任务上,成功率优于人工设计的密集奖励。
- 适合希望减少人工干预的机器人学习研究者。
长时序操作任务因奖励稀疏和时间跨度长,给强化学习带来挑战。自动课程学习(ACL)通过从简单到复杂的任务序列逐步训练来应对这一问题,但其效果依赖于任务相关的具体设定,如明确的任务参数空间和难度度量,这些通常需手动设计且难以泛化。大语言模型(LLMs)凭借其海量常识知识,可将复杂任务分解为有意义的子任务,自然构建课程结构。然而,现有基于LLM的方法仍依赖人工设计的密集奖励函数来学习每个子任务,易引入偏差且需大量人工干预。本文提出LLM增强的自动课程学习(LEACL),将LLM与ACL结合:利用LLM分解任务并生成各子任务的特定规范,再由ACL算法仅使用稀疏奖励信号进行引导学习,避免了密集奖励设计。我们在LIBERO基准上的五个长时序操作任务上评估该方法,结果显示,相比人工设计的密集奖励,LEACL在最终成功率上表现更优。
原文摘要 · Abstract (English)
Long-horizon manipulation tasks pose significant challenges for reinforcement learning due to sparse reward signals and long horizons. Automatic curriculum learning (ACL) has been proposed to tackle these challenges by progressively training agents on a sequence of tasks, from easier to more difficult. However, the success of ACL depends heavily on task-dependent specifications-such as well-defined task parameter spaces and difficulty measures-which are often manually crafted and difficult to generalize across diverse tasks. Recent advances in large language models (LLMs) offer a promising alternative by enabling the decomposition of complex tasks into meaningful subtasks using the LLMs' web-scale common-sense knowledge. This decomposition can provide a natural curriculum structure for efficient learning of long-horizon tasks. However, existing LLM-based methods typically rely on hand-designed dense reward functions to learn each subtask, which can introduce bias and still requires significant human supervision. In this work, we propose LLM-enhanced automatic curriculum learning (LEACL), a framework that integrates LLMs and ACL to address these limitations. Specifically, LLMs are used to both decompose tasks into subtasks and to generate task-dependent specifications for each subtask. These specifications are then used by ACL algorithms to guide learning using only sparse reward signals, eliminating the need for dense reward design. We evaluate LEACL on five long-horizon manipulation tasks from the LIBERO benchmark. LEACL achieves better asymptotic performance in terms of the success rates compared to human-designed dense rewards.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。