Skip to content
Preprint

Towards Purified Multi-Label Test-Time Adaptation of Vision-Language Models

Aug 2026 · 0 citations · 76 references
Computer Science

TL;DR

PuRF is introduced, a novel PuRiFication-driven cache-based method for multi-label test-time adaptation of vision-language models that consistently outperforms state-of-the-art methods on ViT-B/32 across five datasets.

Abstract

Test-time adaptation (TTA) has been widely explored in single-label recognition, effectively mitigating distribution shifts, especially when combined with vision-language models. However, real-world images often contain multiple objects, while the more practical multi-label test-time adaptation (MLTTA) has received little attention so far. Recent cache-based TTA methods have shown promising efficiency and effectiveness, yet directly extending them to multi-label scenarios suffers from a one-to-many mapping problem: a shared global representation entangling co-occurring objects is stored as class-wise cache prototypes, inducing dominant-label bias and compromised cache calibration. While introducing region-level cues helps isolate class-specific evidence, such regional evidence can also be unreliable under distribution shifts, making its identification and utilization non-trivial. To address these issues, we introduce PuRF, a novel PuRiFication-driven cache-based method for multi-label test-time adaptation of vision-language models. Specifically, PuRF first performs region purification to identify reliable regions, providing comprehensive regional cues for multi-label recognition and enabling fine-grained alignment. Based on these purified regions, PuRF conducts cache purification to enhance cache representation and adaptability, where episodic purification builds a discriminative region-based cache, and temporal refreshing further promotes long-term cache adaptability. Experiments demonstrate that PuRF consistently outperforms state-of-the-art methods, achieving a notable 4.05% mAP improvement on ViT-B/32 across five datasets.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

From Inference to Adaptation: A Unified Optimal Transport View of Vision Language Model

This work proposes a principled VLM TTA method called \algname, and theoretically reveals that the InfoNCE loss can be neatly reformulated as a Wasserstein OT formulation, thereby unifying the objectives of the inference and adaptation of VLMs to achieve their mutual benefits.

Qi Yu, Zhichen Zeng, Katherine Tieu et al. · 0 citations
Jul 2026

When Can Test-Time Adaptation Help Zero-Shot CT Vision-Language Models?

Results establish multi-label TTA for zero-shot 3D CT VLMs as a distinct problem and CARVE as a cardinality-aware solution and CARVE provides the most consistent improvements across multi-label, three-class, and binary CT tasks when the base model is already discriminative.

Ailar Mahdizadeh, Puria Azadi Moghadam, Xiangteng He et al. · 0 citations
Preprint Jul 2026

USE: A Unified Self-Ensembling Framework for Test-Time Prompt Tuning

Test-time adaptation (TTA) has emerged as a popular paradigm for improving the performance of vision-language models (e.g., CLIP) on downstream tasks. Among existing CLIP-based TTA methods, Test-Time Prompt Tuning (TPT) is a pioneering work that optimizes textual prompts using multiple test-time augmentations and remai...

Siru Jiang, Jian Liang, Ran He et al. · 0 citations
Preprint Jul 2026

TestMate: Test-Time Domain Adaptation Aided by Lightweight Vision Foundation Model

TestMate is introduced, a novel, real-time, and backpropagation-free TTDA framework that enables immediate adaptation from the first frame, inherently avoids catastrophic forgetting and effectively preserves fine object details and boundaries, even for small objects.

Dimitrios Fotiou, V. Mygdalis, I. Pitas · 0 citations
Preprint Aug 2026

Local Margin Restoration for Test-Time Adaptation of Vision-Language Models

Local Margin Restoration (LMR) is proposed, a lightweight, one-step TTA framework that consistently outperforms state-of-the-art TTA baselines, proving exceptionally robust and efficient even in challenging low-batch test-time regimes.

Yan Huang, Guowei Wang, Xu Wang et al. · 0 citations

Rethinking BCE Loss for Multi-Label Image Recognition with Fine-Tuning

Class-wise Covariance Regularization is proposed, which aligns the predicted covariance structure of class confidences with the semantic correlations encoded in pretrained text embed-dings with the geometric consistency of the class space throughout fine-tuning, resulting in more stable and interpretable confidence dis...

Ao Zhou, Zhi-Wei Jiang, Zi-Feng Cheng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.