Advanced Black-Box Tuning of Large Language Models with Limited API Calls
Not on the map. Why?
Abstract (arXiv)
Black-box tuning is an emerging paradigm for adapting large language models (LLMs) to better achieve desired behaviors, particularly when direct access to model parameters is unavailable. Current strategies, however, often present a dilemma of suboptimal extremes: either separately train a small proxy model and then use it to shift the predictions of the foundation model, offering notable efficiency but often yielding limited improvement; or making API calls in each tuning iteration to the foundation model, which entails prohibitive computational costs. Therefore, we propose a novel advanced black-box tuning method for LLMs with limited API calls. Our core strategy involves training a Gaussian Process (GP) surrogate model with "LogitMap Pairs" derived from querying the foundation model on a minimal but highly informative training subset. This surrogate can approximate the outputs of the foundation model to guide the training of the proxy model, thereby effectively reducing the need for direct queries to the foundation model. Extensive experiments verify that our approach elevates pre-trained language model accuracy from 55.92% to 86.85%, reducing the frequency of API queries to merely 1.38%. This significantly outperforms offline approaches that operate entirely without API access. Notably, our method also achieves comparable or superior accuracy to query-intensive approaches, while significantly reducing API costs. This offers a robust and high-efficiency paradigm for language model adaptation.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 47 references that are in the map. First posted on arXiv 13 Nov 2025.
Builds on
27 of 47 references.
References · 27
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2023Code Llama: Open Foundation Models for Codecited by 2,139
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,554
15 more
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
- 2018Neural Network Acceptability Judgmentscited by 958
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 2017Deep Neural Networks as Gaussian Processescited by 622
- 2024OLMo: Accelerating the Science of Language Modelscited by 613
- 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 460
- 2021DExperts: Decoding-Time Controlled Text Generation with Experts and Anti-Expertscited by 441
- 2023DoLa: Decoding by Contrasting Layers Improves Factuality in Large Language Modelscited by 376
- 2022Black-Box Tuning for Language-Model-as-a-Servicecited by 256
- 2024Aligner: Efficient Alignment by Learning to Correctcited by 98
- 2023Inference-Time Policy Adapters (IPA): Tailoring Extreme-Scale LMs without Fine-tuningcited by 33
- 2023The Benefits of Bad Advice: Autocontrastive Decoding across Model Layerscited by 29
- 2023CombLM: Adapting Black-Box Language Models through Small Fine-Tuned Modelscited by 26
- 2019Domain Differential Adaptation for Neural Machine Translationcited by 10
Built on by
Citing papers per year: 2026: 1.
1 paper.