Pith. sign in

REVIEW 2 cited by

Black-box Prompt Learning for Pre-trained 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 2201.08531 v3 pith:MZ2JECIU submitted 2022-01-21 cs.CL

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

The increasing scale of general-purpose Pre-trained Language Models (PLMs) necessitates the study of more efficient adaptation across different downstream tasks. In this paper, we establish a Black-box Discrete Prompt Learning (BDPL) to resonate with pragmatic interactions between the cloud infrastructure and edge devices. Particularly, instead of fine-tuning the model in the cloud, we adapt PLMs by prompt learning, which efficiently optimizes only a few parameters of the discrete prompts. Moreover, we consider the scenario that we do not have access to the parameters and gradients of the pre-trained models, except for its outputs given inputs. This black-box setting secures the cloud infrastructure from potential attack and misuse to cause a single-point failure, which is preferable to the white-box counterpart by current infrastructures. Under this black-box constraint, we apply a variance-reduced policy gradient algorithm to estimate the gradients of parameters in the categorical distribution of each discrete prompt. In light of our method, the user devices can efficiently tune their tasks by querying the PLMs bounded by a range of API calls. Our experiments on RoBERTa and GPT-3 demonstrate that the proposed algorithm achieves significant improvement on eight benchmarks in a cloud-device collaboration manner. Finally, we conduct in-depth case studies to comprehensively analyze our method in terms of various data sizes, prompt lengths, training budgets, optimization objectives, prompt transferability, and explanations of the learned prompts. Our code will be available at https://github.com/shizhediao/Black-Box-Prompt-Learning.

Discussion (0). Continue with ORCID 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. GenEscape: Hierarchical Multi-Agent Generation of Escape Room Puzzles

    cs.CV 2025-06 conditional novelty 6.0 of 10

    A hierarchical multi-agent framework with GPT-4o generates escape room puzzle images that are judged more solvable and less shortcut-prone than vanilla text-to-image outputs.

  2. Discrete Prompt Tuning via Recursive Utilization of Black-box Multimodal Large Language Model for Personalized Visual Emotion Recognition

    cs.CL 2025-08 conditional novelty 5.0 of 10

    Recursive generation, evaluation, and refinement of discrete prompts tunes a black-box multimodal LLM to each user, raising personalized visual emotion recognition accuracy on Affection from 40.6% to 44.9%.

Pith tools