Reliable Gradient-free and Likelihood-free Prompt Tuning
Not on the map. Why?
Abstract (arXiv)
Due to privacy or commercial constraints, large pre-trained language models (PLMs) are often offered as black-box APIs. Fine-tuning such models to downstream tasks is challenging because one can neither access the model's internal representations nor propagate gradients through it. This paper addresses these challenges by developing techniques for adapting PLMs with only API access. Building on recent work on soft prompt tuning, we develop methods to tune the soft prompts without requiring gradient computation. Further, we develop extensions that in addition to not requiring gradients also do not need to access any internal representation of the PLM beyond the input embeddings. Moreover, instead of learning a single prompt, our methods learn a distribution over prompts allowing us to quantify predictive uncertainty. Ours is the first work to consider uncertainty in prompts when only having API access to the PLM. Finally, through extensive experiments, we carefully vet the proposed methods and find them competitive with (and sometimes even improving on) gradient-based approaches with full access to the PLM.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 33 of its 52 references that are in the map. First posted on arXiv 30 Apr 2023.
Builds on
33 of 52 references.
References · 33
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
21 more
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2018Deep contextualized word representationscited by 2,285
- 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
- 2015A large annotated corpus for learning natural language inferencecited by 1,837
- 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,371
- 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
- 2021GPT Understands, Toocited by 715
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 686
- 2019The frontier of simulation-based inferencecited by 490
- 2018SWAG: A Large-Scale Adversarial Dataset for Grounded Commonsense Inferencecited by 333
- 2020Calibration of Pre-trained Transformerscited by 307
- 2022Black-Box Tuning for Language-Model-as-a-Servicecited by 254
- 2018Sequential Neural Likelihood: Fast Likelihood-free Inference with Autoregressive Flowscited by 217
- 2019Automatic Posterior Transformation for Likelihood-Free Inferencecited by 216
- 2019To Tune or Not to Tune? Adapting Pretrained Representations to Diverse Taskscited by 167
- 2019Text Classification Algorithms: A Surveycited by 163
- 2017Flexible statistical inference for mechanistic models of neural dynamicscited by 162
- 2020On Contrastive Learning for Likelihood-free Inferencecited by 96
- 2021Types of Out-of-Distribution Texts and How to Detect Themcited by 80
- 2018Quantifying Uncertainties in Natural Language Processing Taskscited by 79
- 2019Calibration of Encoder Decoder Models for Neural Machine Translationcited by 67
Built on by
Citing papers per year: 2023: 3; 2024: 3; 2025: 2.
8 papers.
- 2024Evolutionary Computation in the Era of Large Language Model: Survey and Roadmapcited by 89
- 2024When Large Language Models Meet Evolutionary Algorithms: Potential Enhancements and Challengescited by 20
- 2023Adversarial robustness of amortized Bayesian inferencecited by 17
- 2024Hyperband-based Bayesian Optimization for Black-box Prompt Selectioncited by 9
- 2025A Survey of Automatic Prompt Optimization with Instruction-focused Heuristic-based Search Algorithmcited by 6
- 2023A Bayesian approach for prompt optimization in pre-trained language modelscited by 4
- 2023Derivative Free Weight-space Ensemblingcited by 0
- 2025Uncertainty-Aware Calibrated Clinical Text Classification with Large Language Modelscited by 0
- 2025Uncertainty-Aware Calibrated Clinical Text Classification with Large Language Models19 Sep 2025
- 2025A Survey of Automatic Prompt Optimization with Instruction-focused Heuristic-based Search Algorithm26 Feb 2025
- 2024Hyperband-based Bayesian Optimization for Black-box Prompt Selection10 Dec 2024
- 2024When Large Language Models Meet Evolutionary Algorithms: Potential Enhancements and Challenges19 Jan 2024
- 2024Evolutionary Computation in the Era of Large Language Model: Survey and Roadmap18 Jan 2024
- 2023A Bayesian approach for prompt optimization in pre-trained language models1 Dec 2023
- 2023Derivative Free Weight-space Ensembling7 Jul 2023
- 2023Adversarial robustness of amortized Bayesian inference24 May 2023