Pith. sign in

REVIEW 4 cited by

GrIPS: Gradient-free, Edit-based Instruction Search for Prompting Large Language Models

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 2203.07281 v2 pith:LVHSJQGH submitted 2022-03-14 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords gripsmodelsinstructionspromptslanguagelargetuninggradient-based
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Providing natural language instructions in prompts is a useful new paradigm for improving task performance of large language models in a zero-shot setting. Recent work has aimed to improve such prompts via manual rewriting or gradient-based tuning. However, manual rewriting is time-consuming and requires subjective interpretation, while gradient-based tuning can be extremely computationally demanding for large models and may not be feasible for API-based models. In this work, we introduce Gradient-free Instructional Prompt Search (GrIPS), a gradient-free, edit-based search approach for improving task instructions for large language models. GrIPS takes in instructions designed for humans and automatically returns an improved, edited prompt, while allowing for API-based tuning. With InstructGPT models, GrIPS improves the average task performance by up to 4.30 percentage points on eight classification tasks from the Natural Instructions dataset (with similar improvements for OPT, BLOOM, and FLAN-T5). We see improvements for both instruction-only prompts and instruction + k-shot examples prompts. Notably, GrIPS outperforms manual rewriting and purely example-based prompts while controlling for the available compute and data budget. Further, performance of GrIPS is comparable to select gradient-based tuning approaches. Qualitatively, we show our edits can simplify instructions and at times make them incoherent but nonetheless improve accuracy. Our code is available at: https://github.com/archiki/GrIPS

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Grammar-Guided Evolutionary Search for Discrete Prompt Optimisation

    cs.CL 2025-07 conditional novelty 6.0 of 10

    A grammar-guided evolutionary search that composes prompt edits outperformed PromptWizard, OPRO, and RL-Prompt on small LLMs across four domain-specific tasks.

  2. Audit, Alignment, and Optimization of LM-Powered Subroutines with Application to Public Comment Processing

    cs.CL 2025-07 conditional novelty 4.0 of 10

    A framework for auditable, type-checked LM subroutines with bandit prompt optimization and self-critique is applied to NEPA public comment processing; the baseline evaluation shows high quote precision but low recall.

  3. Tournament of Prompts: Evolving LLM Instructions Through Structured Debates and Elo Ratings

    cs.AI 2025-05 conditional novelty 4.0 of 10

    DEEVO evolves better LLM prompts by debating outputs and selecting survivors with Elo ratings, without requiring labeled data or a hand-written fitness function.

  4. Evolutionary Computation and Large Language Models: A Survey of Methods, Synergies, and Applications

    cs.NE 2025-05 conditional novelty 4.0 of 10

    A survey that maps bidirectional synergies between evolutionary computation and large language models and proposes a taxonomy plus research gaps.

Pith tools