paper-with-me

홈 › Papers

Visual Prompt Tuning for Test-time Domain Adaptation

2022-10-10 · Yunhe Gao, Xingjian Shi, Yi Zhu, Hao Wang, Zhiqiang Tang, Xiong Zhou, Mu Li, Dimitris N. Metaxas

Models should be able to adapt to unseen data during test-time to avoid performance drops caused by inevitable distribution shifts in real-world deployment scenarios. In this work, we tackle the practical yet challenging test-time adaptation (TTA) problem, where a model adapts to the target domain without accessing the source data. We propose a simple recipe called \textit{Data-efficient Prompt Tuning} (DePT) with two key ingredients. First, DePT plugs visual prompts into the vision Transformer and only tunes these source-initialized prompts during adaptation. We find such parameter-efficient finetuning can efficiently adapt the model representation to the target domain without overfitting to the noise in the learning objective. Second, DePT bootstraps the source representation to the target domain by memory bank-based online pseudo-labeling. A hierarchical self-supervised regularization specially designed for prompts is jointly optimized to alleviate error accumulation during self-training. With much fewer tunable parameters, DePT demonstrates not only state-of-the-art performance on major adaptation benchmarks VisDA-C, ImageNet-C, and DomainNet-126, but also superior data efficiency, i.e., adaptation with only 1\% or 10\% data without much performance degradation compared to 100\% data. In addition, DePT is also versatile to be extended to online or multi-source TTA settings.

📄 PDF Abstract BibTeX arXiv:2210.04831

Code (0)

등록된 구현이 없습니다.

Tasks

Domain AdaptationTest-time AdaptationUnsupervised Domain AdaptationVisual Prompt Tuning

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Position-Wise Feed-Forward Layer 설명 없음
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Adam 설명 없음

Similar Papers 제목 키워드 기반

Historical Test-time Prompt Tuning for Vision Foundation Models

2024-10-27 · Jingyi Zhang, Jiaxing Huang, Xiaoqin Zhang, Ling Shao 외

Test-time prompt tuning, which learns prompts online with unlabelled test samples during the inference stage, has demonstrated great potential by learning effective prompts on-the-fly without requiring any task-specific …

image-classificationImage ClassificationMemorizationobject-detection+2

VPA: Fully Test-Time Visual Prompt Adaptation

2023-09-26 · Jiachen Sun, Mark Ibrahim, Melissa Hall, Ivan Evtimov 외

Textual prompt tuning has demonstrated significant performance improvements in adapting natural language processing models to a variety of downstream tasks by treating hand-engineered prompts as trainable parameters. Ins…

Domain AdaptationPseudo LabelTest-time AdaptationVisual Prompting+2

Test-Time Visual In-Context Tuning

2025-03-27 · CVPR 2025 1 · Jiahao Xie, Alessio Tonioni, Nathalie Rauschmayr, Federico Tombari 외

Visual in-context learning (VICL), as a new paradigm in computer vision, allows the model to rapidly adapt to various tasks with only a handful of prompts and examples. While effective, the existing VICL paradigm exhibit…

In-Context Learning

MetaTPT: Meta Test-time Prompt Tuning for Vision-Language Models

2025-12-13 · Yuqing Lei, Yingjun Du, Yawen Huang, Xiantong Zhen 외 arxiv

Vision-language models (VLMs) such as CLIP exhibit strong zero-shot generalization but remain sensitive to domain shifts at test time. Test-time prompt tuning (TPT) mitigates this issue by adapting prompts with fixed aug…

Zero-shot GeneralizationDomain GeneralizationTest-time Adaptation

GFMate: Empowering Graph Foundation Models with Test-time Prompt Tuning

2026-05-14 · Yan Jiang, Ruihong Qiu, Zi Huang arxiv

Graph prompt tuning has shown great potential in graph learning by introducing trainable prompts to enhance the model performance in conventional single-domain scenarios. Recent research has extended graph prompts to imp…

Graph Learning