Pith. sign in

REVIEW 2 cited by

Zero-Label Prompt Selection

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 2211.04668 v1 pith:S2Y3DTAE submitted 2022-11-09 cs.CL

classification cs.CL
keywords promptpromptsselectionzero-labelcross-taskdatagivenlabeled
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Natural language prompts have been shown to facilitate cross-task generalization for large language models. However, with no or limited labeled examples, the cross-task performance is highly sensitive to the choice of prompts, while selecting a high-performing prompt is challenging given the scarcity of labels. To address the issue, we propose a Zero-Label Prompt Selection (ZPS) method that selects prompts without any labeled data or gradient update. Specifically, given the candidate human-written prompts for a task, ZPS labels a set of unlabeled data with a prompt ensemble and uses the pseudo-labels for prompt selection. Experiments show that ZPS improves over prior methods by a sizeable margin in zero-label performance. We also extend ZPS to a few-shot setting and show its advantages over strong baselines such as prompt tuning and model tuning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Evolving Prompts In-Context: An Open-ended, Self-replicating Perspective

    cs.AI 2025-06 conditional novelty 7.0 of 10

    Pruning example prompts given to a language model into 'gibberish' through evolutionary search can match or beat automatic prompt optimizers across several tasks.

  2. Object Search in Partially-Known Environments via LLM-informed Model-based Planning and Prompt Selection

    cs.RO 2026-03 conditional novelty 6.0 of 10

    LLM-estimated object-location probabilities plus map costs yield a model-based planner that beats pure-LLM and optimistic search, while offline replay selects prompts/LLMs faster than UCB.

Pith tools