pith. sign in

arxiv: 2310.18127 · v2 · pith:P7CN5XXUnew · submitted 2023-10-27 · 💻 cs.LG · cs.AI· cs.CL

Ask more, know better: Reinforce-Learned Prompt Questions for Decision Making with Large Language Models

classification 💻 cs.LG cs.AIcs.CL
keywords frameworkactionshumanlearningpoliciespromptsreasoningaction
0
0 comments X
read the original abstract

Large language models (LLMs) demonstrate their promise in tackling complicated practical challenges by combining action-based policies with chain of thought (CoT) reasoning. Having high-quality prompts on hand, however, is vital to the framework's effectiveness. Currently, these prompts are handcrafted utilising extensive human labor, resulting in CoT policies that frequently fail to generalise. Human intervention is also required to develop grounding functions that ensure low-level controllers appropriately process CoT reasoning. In this paper, we propose a comprehensive training framework for complex task-solving, incorporating human prior knowledge into the learning of action policies. To that purpose, we offer a new leader-follower bilevel framework that is capable of learning to ask relevant questions (prompts) and subsequently undertaking reasoning to guide the learning of actions. The prompt policy is employed to make introspective revisions based on historical findings, leading the CoT process to consider the anticipated goals and generate outputs that lead to decisive, high-performing actions. The action policy subsequently learns to comprehend and integrate the CoT outputs to take actions. Our empirical data reveal that our framework outperforms leading methods in $5$ decision-making tasks such as Overcooked and FourRoom.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. On the Limits of Prompt-Conditioned Language Models as General-Purpose Learners

    cs.LG 2026-06 unverdicted novelty 6.0

    Prompt-conditioned LLMs face irreducible error floors from language's limited information capacity and alignment constraints, proven via PAC-Bayes bounds on bilevel cheap-talk games for certain task families.