Pith. sign in

REVIEW 4 cited by

MetaPrompting: Learning to Learn Better Prompts

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 2209.11486 v4 pith:KAIY6OKU submitted 2022-09-23 cs.CL

MetaPrompting: Learning to Learn Better Prompts

classification cs.CL
keywords initializationpromptingpromptssoftbettermetapromptingpromptimprovement
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Prompting method is regarded as one of the crucial progress for few-shot nature language processing. Recent research on prompting moves from discrete tokens based ``hard prompts'' to continuous ``soft prompts'', which employ learnable vectors as pseudo prompt tokens and achieve better performance. Though showing promising prospects, these soft-prompting methods are observed to rely heavily on good initialization to take effect. Unfortunately, obtaining a perfect initialization for soft prompts requires understanding of inner language models working and elaborate design, which is no easy task and has to restart from scratch for each new task. To remedy this, we propose a generalized soft prompting method called MetaPrompting, which adopts the well-recognized model-agnostic meta-learning algorithm to automatically find better prompt initialization that facilitates fast adaptation to new prompting tasks.Extensive experiments show MetaPrompting tackles soft prompt initialization problem and brings significant improvement on four different datasets (over 6 points improvement in accuracy for 1-shot setting), achieving new state-of-the-art performance.

discussion (0)

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

Forward citations

Cited by 4 Pith papers

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

  1. Foundation Models as Oracles for Refactoring Correctness Detection

    cs.SE 2026-05 unverdicted novelty 7.0

    Foundation models serve as effective oracles for detecting refactoring correctness issues in Java programs, achieving up to 93.8% accuracy in zero-shot evaluations on 226 real bugs.

  2. VTOS: Learning to Orchestrate Vision Tools by Co-Searching Solutions and Observers

    cs.CV 2026-06 unverdicted novelty 6.0

    VTOS jointly searches solution and observer programs to adaptively orchestrate vision tools, outperforming static pipelines on dense object counting and zero-shot plant disease segmentation.

  3. An Empirical Study of Foundation Models for Variability-Induced Compilation Errors in Configurable C Code

    cs.SE 2026-01 conditional novelty 6.0

    On a synthetic benchmark of configurable C snippets, GPT-OSS-20B detected affected configurations with 84.7% precision and 52.1% recall and repaired 72.4% of faulty snippets; a smaller real-world study suggests practi...

  4. Foundation Models as Oracles for Refactoring Correctness Detection

    cs.SE 2026-05 unverdicted novelty 4.0

    Foundation models achieve up to 93.8% accuracy detecting refactoring bugs across 47 types in Java IDEs via zero-shot prompting on 226 real cases.