Visual Prompt Tuning

Menglin Jia, Luming Tang, Bor-Chun Chen, Claire Cardie, Serge Belongie +2 more
3/23/2022
cs.CV

Official code: KMnP/vpt (1,238 stars, last commit 2023-09-02).

Abstract

The current modus operandi in adapting pre-trained models involves updating all the backbone parameters, ie, full fine-tuning. This paper introduces Visual Prompt Tuning (VPT) as an efficient and effective alternative to full fine-tuning for large-scale Transformer models in vision. Taking inspiration from recent advances in efficiently tuning large language models, VPT introduces only a small amount (less than 1% of model parameters) of trainable parameters in the input space while keeping the model backbone frozen. Via extensive experiments on a wide variety of downstream recognition tasks, we show that VPT achieves significant performance gains compared to other parameter efficient tuning protocols. Most importantly, VPT even outperforms full fine-tuning in many cases across model capacities and training data scales, while reducing per-task storage cost.

View on arXivView PDF

Code Implementations(1)

KMnP/vptOfficial100%

❄️🔥 Visual Prompt Tuning [ECCV 2022] https://arxiv.org/abs/2203.12119

1,238104Shell, PythonJul 10, 20223 years agoNOASSERTION

Similar Papers

Cite this paper

@article{jia2022visual,
  title  = {Visual Prompt Tuning},
  author = {Menglin Jia and Luming Tang and Bor-Chun Chen and Claire Cardie and Serge Belongie and Bharath Hariharan and Ser-Nam Lim},
  year   = {2022},
  eprint = {2203.12119},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2203.12119}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2203.12119.svg)](https://codeofpaper.com/paper/2203.12119)

Discussion