mlsanityData to 7 Oct 2026

`A-la-carte Prompt Tuning (APT): Combining Distinct Data Via Composable Prompting

arXiv 2302.07994 ↗First posted 15 Feb 2023cs.LG cs.AI cs.CLcited by 17

Not on the map. Why?

Abstract (arXiv)

We introduce `A-la-carte Prompt Tuning (APT), a transformer-based scheme to tune prompts on distinct data so that they can be arbitrarily composed at inference time. The individual prompts can be trained in isolation, possibly on different devices, at different times, and on different distributions or domains. Furthermore each prompt only contains information about the subset of data it was exposed to during training. During inference, models can be assembled based on arbitrary selections of data sources, which we call "`a-la-carte learning". `A-la-carte learning enables constructing bespoke models specific to each user's individual access rights and preferences. We can add or remove information from the model by simply adding or removing the corresponding prompts without retraining from scratch. We demonstrate that `a-la-carte built models achieve accuracy within 5% of models trained on the union of the respective sources, with comparable cost in terms of training and inference time. For the continual learning benchmarks Split CIFAR-100 and CORe50, we achieve state-of-the-art performance.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 27 of its 43 references that are in the map. First posted on arXiv 15 Feb 2023.

Builds on

27 of 43 references.

References · 27

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  6. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  7. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  8. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  9. 2016Learning without Forgettingcited by 2,465
  10. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
  11. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
  12. 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
15 more
  1. 2022Visual Prompt Tuningcited by 1,674
  2. 2021Align before Fuse: Vision and Language Representation Learning with Momentum Distillationcited by 1,612
  3. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
  4. 2019Machine Unlearningcited by 1,020
  5. 2021Learning to Prompt for Continual Learningcited by 938
  6. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 599
  7. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
  8. 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
  9. 2017CORe50: a New Dataset and Benchmark for Continuous Object Recognitioncited by 287
  10. 2020Approximate Data Deletion from Machine Learning Modelscited by 250
  11. 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246
  12. 2020Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observationscited by 171
  13. 2020Mixed-Privacy Forgetting in Deep Networkscited by 158
  14. 2020Rethinking the Hyperparameters for Fine-tuningcited by 69
  15. 2022Fine-tuning Image Transformers using Learnable Memorycited by 34

Built on by

Cited by year

Citing papers per year: 2023: 5; 2024: 10; 2025: 2.

17 papers.

Sort:

By area: