Does VLM Classification Benefit from LLM Description Semantics?

Pingchuan Ma, Lennart Rietdorf, Dmytro Kotovenko, Vincent Tao Hu, Björn Ommer
12/16/2024
cs.CV

No official code found. Best implementation: CompVis/DisCLIP (26 stars, last commit 2025-08-05).

Abstract

Accurately describing images with text is a foundation of explainable AI. Vision-Language Models (VLMs) like CLIP have recently addressed this by aligning images and texts in a shared embedding space, expressing semantic similarities between vision and language embeddings. VLM classification can be improved with descriptions generated by Large Language Models (LLMs). However, it is difficult to determine the contribution of actual description semantics, as the performance gain may also stem from a semantic-agnostic ensembling effect, where multiple modified text prompts act as a noisy test-time augmentation for the original one. We propose an alternative evaluation scenario to decide if a performance boost of LLM-generated descriptions is caused by such a noise augmentation effect or rather by genuine description semantics. The proposed scenario avoids noisy test-time augmentation and ensures that genuine, distinctive descriptions cause the performance boost. Furthermore, we propose a training-free method for selecting discriminative descriptions that work independently of classname-ensembling effects. Our approach identifies descriptions that effectively differentiate classes within a local CLIP label neighborhood, improving classification accuracy across seven datasets. Additionally, we provide insights into the explainability of description-based image classification with VLMs.

View on arXivView PDF

Code Implementations(1)

CompVis/DisCLIPCommunity100%

[AAAI 2025] Does VLM Classification Benefit from LLM Description Semantics?

260PythonNov 25, 20241 years ago

Similar Papers

Cite this paper

@article{ma2024does,
  title  = {Does VLM Classification Benefit from LLM Description Semantics?},
  author = {Pingchuan Ma and Lennart Rietdorf and Dmytro Kotovenko and Vincent Tao Hu and Björn Ommer},
  year   = {2024},
  eprint = {2412.11917},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.11917v3}
}

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

Discussion