Distribution-Aware Prompt Tuning for Vision-Language Models

Eulrang Cho, Jooyeon Kim, Hyunwoo J. Kim
2/14/2026

No official code found. Best implementation: mlvlab/DAPT (46 stars, MIT, last commit 2023-12-11).

Abstract

Pre-trained vision-language models (VLMs) have shown impressive performance on various downstream tasks by utilizing knowledge learned from large data. In general, the performance of VLMs on target tasks can be further improved by prompt tuning, which adds context to the input image or text. By leveraging data from target tasks, various prompt-tuning methods have been studied in the literature. A key to prompt tuning is the feature space alignment between two modalities via learnable vectors with model parameters fixed. We observed that the alignment becomes more effective when embeddings of each modality are ‘well-arranged’ in the latent space. Inspired by this observation, we proposed distribution-aware prompt tuning (DAPT) for vision-language models, which is simple yet effective. Specifically, the prompts are learned by maximizing inter-dispersion, the distance between classes, as well as minimizing the intra-dispersion measured by the distance between embeddings from the same class. Our extensive experiments on 11 benchmark datasets demonstrate that our method significantly improves generalizability. The code is available at https://github.com/mlvlab/DAPT.

View on arXivView PDF

Code Implementations(1)

mlvlab/DAPTCommunity100%
MIT

Distribution-Aware Prompt Tuning for Vision-Language Models (ICCV 2023)

465Shell, PythonAug 16, 20232 years agoMIT
computer-visioniccv2023multimodal-learningprompt-tuning

Similar Papers

Cite this paper

@article{cho2026distributionaware,
  title  = {Distribution-Aware Prompt Tuning for Vision-Language Models},
  author = {Eulrang Cho and Jooyeon Kim and Hyunwoo J. Kim},
  year   = {2026},
  eprint = {2309.03406},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2309.03406},
  journal = {ICCV 2023 2023}
}

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/2309.03406.svg)](https://codeofpaper.com/paper/2309.03406)

Discussion