GPS: General Per-Sample Prompter
Pawel Batorski, Paul Swoboda

TL;DR
GPS introduces a novel per-sample prompting method for large language models that generates adaptive, input-specific prompts without task-specific training, enhancing performance across multiple NLP tasks.
Contribution
The paper presents the first general-purpose, per-sample prompting approach trained with reinforcement learning, eliminating the need for task-specific datasets and extensive optimization.
Findings
Achieves second best on text simplification
Attains third best on summarization
Matches state-of-the-art on GSM8K in in-domain prompting
Abstract
LLMs are sensitive to prompting, with task performance often hinging on subtle, sometimes imperceptible variations in phrasing. As a result, crafting effective prompts manually remains challenging and time-consuming. Recent automatic prompting methods mitigate this difficulty but face three key limitations: (i) for each new task, they require large datasets to train good prompts;(ii) they rely on costly optimization loops that may take hours; (iii)they typically produce a single task-level prompt that does not adapt to the individual input problem to be solved. We propose GPS, the first general-purpose, per-sample prompting method. Without any task-specific tuning, GPS generates a tailored prompt for each unseen input, improving performance across diverse tasks. The prompter is trained with reinforcement learning on a suite of training tasks and includes a novel regularization for…
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
TopicsText Readability and Simplification · Topic Modeling · Natural Language Processing Techniques
