Large Language Models Prompting With Episodic Memory
Dai Do, Quan Tran, Svetha Venkatesh, Hung Le

TL;DR
This paper introduces POEM, a novel prompt optimization method for Large Language Models that uses episodic memory and reinforcement learning to improve few-shot learning performance efficiently and effectively.
Contribution
POEM is a simple, efficient prompt optimization technique that leverages episodic memory and reinforcement learning, outperforming existing methods in text classification and language understanding tasks.
Findings
POEM outperforms TEMPERA and RLPrompt by over 5.3% in text classification.
The approach generalizes well to broader language understanding tasks.
POEM demonstrates strong adaptation and superior performance over heuristic methods.
Abstract
Prompt optimization is essential for enhancing the performance of Large Language Models (LLMs) in a range of Natural Language Processing (NLP) tasks, particularly in scenarios of few-shot learning where training examples are incorporated directly into the prompt. Despite the growing interest in optimizing prompts with few-shot examples, existing methods for prompt optimization are often resource-intensive or perform inadequately. In this work, we propose PrOmpting with Episodic Memory (POEM), a novel prompt optimization technique that is simple, efficient, and demonstrates strong generalization capabilities. We approach prompt optimization as a Reinforcement Learning (RL) challenge, using episodic memory to archive combinations of input data, permutations of few-shot examples, and the rewards observed during training. In the testing phase, we optimize the sequence of examples for each…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling
