Pith. sign in

REVIEW 2 cited by

LLM Augmented Hierarchical Agents

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.05596 v1 pith:KWDQAP53 submitted 2023-11-09 cs.LG cs.AIcs.RO

classification cs.LGcs.AIcs.RO
keywords learningllmstasksagentssolveapproachbecausehierarchical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Solving long-horizon, temporally-extended tasks using Reinforcement Learning (RL) is challenging, compounded by the common practice of learning without prior knowledge (or tabula rasa learning). Humans can generate and execute plans with temporally-extended actions and quickly learn to perform new tasks because we almost never solve problems from scratch. We want autonomous agents to have this same ability. Recently, LLMs have been shown to encode a tremendous amount of knowledge about the world and to perform impressive in-context learning and reasoning. However, using LLMs to solve real world problems is hard because they are not grounded in the current task. In this paper we exploit the planning capabilities of LLMs while using RL to provide learning from the environment, resulting in a hierarchical agent that uses LLMs to solve long-horizon tasks. Instead of completely relying on LLMs, they guide a high-level policy, making learning significantly more sample efficient. This approach is evaluated in simulation environments such as MiniGrid, SkillHack, and Crafter, and on a real robot arm in block manipulation tasks. We show that agents trained using our approach outperform other baselines methods and, once trained, don't need access to LLMs during deployment.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Accelerating Reinforcement Learning Algorithms Convergence using Pre-trained Large Language Models as Tutors With Advice Reusing

    cs.LG 2025-09 conditional novelty 4.0 of 10

    LLM tutoring modestly accelerates RL convergence on average, with advice reuse saving wall-clock time but reducing stability.

  2. Feedback-Induced Performance Decline in LLM-Based Decision-Making

    cs.AI 2025-07 reject novelty 4.0 of 10

    Adding dynamics, reward, and policy feedback to LLM prompts degrades their already poor decision-making performance in MiniGrid navigation tasks.

Pith tools