mlsanityData to 7 Oct 2026

SCOPE: Language Models as One-Time Teacher for Hierarchical Planning in Text Environments

arXiv 2512.09897 ↗First posted 10 Dec 2025cs.AI cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Long-term planning in complex, text-based environments presents significant challenges due to open-ended action spaces, ambiguous observations, and sparse feedback. Recent research suggests that large language models (LLMs) encode rich semantic knowledge about the world, which can be valuable for guiding agents in high-level reasoning and planning across both embodied and purely textual settings. However, existing approaches often depend heavily on querying LLMs during training and inference, making them computationally expensive and difficult to deploy efficiently. In addition, these methods typically employ a pretrained, unaltered LLM whose parameters remain fixed throughout training, providing no opportunity for adaptation to the target task. To address these limitations, we introduce SCOPE (Subgoal-COnditioned Pretraining for Efficient planning), a one-shot hierarchical planner that leverages LLM-generated subgoals only at initialization to pretrain a lightweight student model. Unlike prior approaches that distill LLM knowledge by repeatedly prompting the model to adaptively generate subgoals during training, our method derives subgoals directly from example trajectories. This design removes the need for repeated LLM queries, significantly improving efficiency, though at the cost of reduced explainability and potentially suboptimal subgoals. Despite their suboptimality, our results on the TextCraft environment show that LLM-generated subgoals can still serve as a strong starting point for hierarchical goal decomposition in text-based planning tasks. Compared to the LLM-based hierarchical agent ADaPT (Prasad et al., 2024), which achieves a 0.52 success rate, our method reaches 0.56 and reduces inference time from 164.4 seconds to just 3.0 seconds.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 40 references that are in the map. First posted on arXiv 10 Dec 2025.

Builds on

21 of 40 references.

References · 21

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  3. 2024Qwen2.5 Technical Reportcited by 4,713
  4. 2022Do As I Can, Not As I Say: Grounding Language in Robotic Affordancescited by 2,302
  5. 2018Data-Efficient Hierarchical Reinforcement Learningcited by 436
  6. 2023Describe, Explain, Plan and Select: Interactive Planning with Large Language Models Enables Open-World Multi-Task Agentscited by 396
  7. 2019Relay Policy Learning: Solving Long-Horizon Tasks via Imitation and Reinforcement Learningcited by 380
  8. 2017FeUdal Networks for Hierarchical Reinforcement Learningcited by 328
  9. 2023ADaPT: As-Needed Decomposition and Planning with Language Modelscited by 172
  10. 2017Stochastic Neural Networks for Hierarchical Reinforcement Learningcited by 124
  11. 2024A Survey on Large Language Model-Based Game Agentscited by 106
  12. 2019Exploring Model-based Planning with Policy Networkscited by 90
9 more
  1. 2019Why Does Hierarchy (Sometimes) Work So Well in Reinforcement Learning?cited by 66
  2. 2019Data Efficient Reinforcement Learning for Legged Robotscited by 60
  3. 2024Plan-Seq-Learn: Language Model Guided RL for Solving Long Horizon Robotics Taskscited by 51
  4. 2017Multi-Level Discovery of Deep Optionscited by 50
  5. 2023SayTap: Language to Quadrupedal Locomotioncited by 40
  6. 2024Comprehensive Overview of Reward Engineering and Shaping in Advancing Reinforcement Learning Applicationscited by 34
  7. 2023Large Language Model as a Policy Teacher for Training Reinforcement Learning Agentscited by 30
  8. 2024OmniJARVIS: Unified Vision-Language-Action Tokenization Enables Open-World Instruction Following Agentscited by 30
  9. 2018Hierarchical Reinforcement Learning with Hindsightcited by 26

Built on by

Not cited yet.