Pith. sign in

REVIEW 3 cited by

An Information-theoretic Approach to Prompt Engineering Without Ground Truth Labels

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.11364 v1 pith:DQKRPW7N submitted 2022-03-21 cs.CL cs.LG

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

Pre-trained language models derive substantial linguistic and factual knowledge from the massive corpora on which they are trained, and prompt engineering seeks to align these models to specific tasks. Unfortunately, existing prompt engineering methods require significant amounts of labeled data, access to model parameters, or both. We introduce a new method for selecting prompt templates \textit{without labeled examples} and \textit{without direct access to the model}. Specifically, over a set of candidate templates, we choose the template that maximizes the mutual information between the input and the corresponding model output. Across 8 datasets representing 7 distinct NLP tasks, we show that when a template has high mutual information, it also has high accuracy on the task. On the largest model, selecting prompts with our method gets 90\% of the way from the average prompt accuracy to the best prompt accuracy and requires no ground truth labels.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. 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.

  2. If You Had to Pitch Your Ideal Software -- Evaluating Large Language Models to Support User Scenario Writing for User Experience Experts and Laypersons

    cs.HC 2025-06 conditional novelty 6.0 of 10

    Laypeople using an LLM writing assistant produced user scenarios rated as high in structure and clarity as those written by UX experts.

  3. DICE: Dynamic In-Context Example Selection in LLM Agents via Efficient Knowledge Transfer

    cs.AI 2025-07 conditional novelty 5.0 of 10

    DICE dynamically retrieves the most relevant in-context demonstrations at each agent step, and in this preprint it raises exact-match and success-rate scores on HotpotQA, ALFWorld, and Webshop across ReAct, Reflexion,...

Pith tools