mlsanityData to 7 Oct 2026

Robust Adaptation of Foundation Models with Black-Box Visual Prompting

arXiv 2407.17491 ↗First posted 4 Jul 2024cs.CV cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

With a surge of large-scale pre-trained models, parameter-efficient transfer learning (PETL) of large models has garnered significant attention. While promising, they commonly rely on two optimistic assumptions: 1) full access to the parameters of a PTM, and 2) sufficient memory capacity to cache all intermediate activations for gradient computation. However, in most real-world applications, PTMs serve as black-box APIs or proprietary software without full parameter accessibility. Besides, it is hard to meet a large memory requirement for modern PTMs. This work proposes black-box visual prompting (BlackVIP), which efficiently adapts the PTMs without knowledge of their architectures or parameters. BlackVIP has two components: 1) Coordinator and 2) simultaneous perturbation stochastic approximation with gradient correction (SPSA-GC). The Coordinator designs input-dependent visual prompts, which allow the target PTM to adapt in the wild. SPSA-GC efficiently estimates the gradient of PTM to update Coordinator. Besides, we introduce a variant, BlackVIP-SE, which significantly reduces the runtime and computational cost of BlackVIP. Extensive experiments on 19 datasets demonstrate that BlackVIPs enable robust adaptation to diverse domains and tasks with minimal memory requirements. We further provide a theoretical analysis on the generalization of visual prompting methods by presenting their connection to the certified robustness of randomized smoothing, and presenting an empirical support for improved robustness.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 72 of its 128 references that are in the map. First posted on arXiv 4 Jul 2024.

Builds on

72 of 128 references.

References · 72

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  5. 2023GPT-4 Technical Reportcited by 18,132
  6. 2023Visual Instruction Tuningcited by 7,792
  7. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  8. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  9. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  10. 2020Scaling Laws for Neural Language Modelscited by 6,411
  11. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  12. 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,848
38 more
  1. 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
  2. 2021Learning to Prompt for Vision-Language Modelscited by 2,269
  3. 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
  4. 2022Visual Prompt Tuningcited by 1,674
  5. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
  6. 2016CLEVR: A Diagnostic Dataset for Compositional Language and Elementary Visual Reasoningcited by 1,445
  7. 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,427
  8. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  9. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
  10. 2021CLIP-Adapter: Better Vision-Language Models with Feature Adapterscited by 1,021
  11. 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
  12. 2015The Limitations of Deep Learning in Adversarial Settingscited by 784
  13. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
  14. 2022AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognitioncited by 714
  15. 2022MaPLe: Multi-modal Prompt Learningcited by 685
  16. 2022Vision Transformer Adapter for Dense Predictionscited by 564
  17. 2020What is being transferred in transfer learning?cited by 365
  18. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  19. 2022RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learningcited by 361
  20. 2022Tip-Adapter: Training-free Adaption of CLIP for Few-shot Classificationcited by 355
  21. 2022Prompt-aligned Gradient for Prompt Tuningcited by 339
  22. 2017Functional Map of the Worldcited by 338
  23. 2021Prompting Visual-Language Models for Efficient Video Understandingcited by 309
  24. 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 307
  25. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  26. 2022What does a platypus look like? Generating customized prompts for zero-shot image classificationcited by 263
  27. 2022Black-Box Tuning for Language-Model-as-a-Servicecited by 254
  28. 2019Adversarial Attacks and Defenses in Images, Graphs and Text: A Reviewcited by 234
  29. 2022LST: Ladder Side-Tuning for Parameter and Memory Efficient Transfer Learningcited by 228
  30. 2019Learning De-biased Representations with Biased Representationscited by 199
  31. 2020A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learningcited by 160
  32. 2022Unified Vision and Language Prompt Learningcited by 145
  33. 2021Benchmarking Detection Transfer Learning with Vision Transformerscited by 130
  34. 2021Self-supervised Learning is More Robust to Dataset Imbalancecited by 122
  35. 2018Adversarial Reprogramming of Neural Networkscited by 115
  36. 2018Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimizationcited by 109
  37. 2023Memory-Efficient Fine-Tuning of Compressed Large Language Models via sub-4-bit Integer Quantizationcited by 97
  38. 2022Understanding and Improving Visual Prompting: A Label-Mapping Perspectivecited by 86

50 most cited of 72 All 72 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.