Pith. sign in

REVIEW 9 cited by

InstructZero: Efficient Instruction Optimization for Black-Box 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 2306.03082 v2 pith:UYHYEA6Z submitted 2023-06-05 cs.AI

InstructZero: Efficient Instruction Optimization for Black-Box Large Language Models

classification cs.AI
keywords instructioninstructzeroblack-boxllmsopen-sourcesoftdifferentlanguage
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Large language models~(LLMs) are instruction followers, but it can be challenging to find the best instruction for different situations, especially for black-box LLMs on which backpropagation is forbidden. Instead of directly optimizing the discrete instruction, we optimize a low-dimensional soft prompt applied to an open-source LLM to generate the instruction for the black-box LLM. On each iteration of the proposed method, which we call InstructZero, a soft prompt is converted into an instruction using the open-source LLM, which is then submitted to the black-box LLM for zero-shot evaluation, and the performance is sent to Bayesian optimization to produce new soft prompts improving the zero-shot performance. We evaluate InstructZero on different combinations of open-source LLMs and APIs including Vicuna and ChatGPT. Our results show that InstructZero outperforms SOTA auto-instruction methods across a variety of downstream tasks. Our code and data are publicly available at https://github.com/Lichang-Chen/InstructZero.

discussion (0)

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

Forward citations

Cited by 9 Pith papers

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

  1. Embedding by Elicitation: Dynamic Representations for Bayesian Optimization of System Prompts

    cs.AI 2026-05 unverdicted novelty 7.0

    ReElicit uses LLMs to elicit adaptive feature embeddings for Gaussian process Bayesian optimization of system prompts under aggregate-only feedback, outperforming baselines across ten tasks with a 30-evaluation budget.

  2. Towards Spec Learning: Inference-Time Alignment from Preference Pairs

    cs.CL 2026-06 unverdicted novelty 6.0

    Proposes compiling preference pairs into readable natural-language specifications for inference-time LLM alignment, claiming outperformance over DPO on dense-preference domains.

  3. Unveiling Privacy Risks in Multi-modal Large Language Models: Task-specific Vulnerabilities and Mitigation Challenges

    cs.CR 2026-06 unverdicted novelty 6.0

    Introduces MM-Privacy dataset and evaluations showing MLLMs leak sensitive data from images in various tasks, highlighting task inconsistency effects.

  4. Select Smarter, Not More: Prompt-Aware Evaluation Scheduling with Submodular Guarantees

    cs.AI 2026-04 unverdicted novelty 6.0

    POES frames prompt evaluation as online adaptive testing and uses a provably submodular objective to pick informative examples, delivering 6.2% higher average accuracy and 35-60% token savings versus naive full-set scoring.

  5. MASPOB: Bandit-Based Prompt Optimization for Multi-Agent Systems with Graph Neural Networks

    cs.LG 2026-03 conditional novelty 6.0

    MASPOB combines a GNN surrogate, LinUCB-style uncertainty, and coordinate ascent to optimize prompts in fixed-topology multi-agent LLM systems, beating AFlow and MIPRO on average across six benchmarks.

  6. Personalization as Inverse Planning: Learning Latent Design Intents for Agentic Slide Generation via Structural Denoising

    cs.AI 2026-07 unverdicted novelty 5.0

    SPIRE approximates page-level slide personalization by training agents to denoise corrupted slide structures via collaborative RL, claiming a proof of consistency as a surrogate for inverse planning.

  7. Towards Spec Learning: Inference-Time Alignment from Preference Pairs

    cs.CL 2026-06 unverdicted novelty 5.0

    Spec learning compiles brief instructions and preference pairs into readable natural-language specifications that condition LLMs at inference time and can outperform DPO on domains with dense preference signals.

  8. Interpretable Adaptive Sampling for LLM Test-Time Scaling

    cs.AI 2026-08 reject novelty 4.0

    A fuzzy controller that allocates a per-prompt sampling budget keeps LLM accuracy near a fixed full-budget baseline while reducing the average number of candidate answers on some datasets.

  9. Deploying AI for Signal Processing education: Selected challenges and intriguing opportunities

    eess.SP 2025-09 conditional novelty 4.0

    AI can be used to generate interactive signal processing courseware, but the paper offers no evidence that students learn better from it.