REVIEW 4 cited by
Prompt Vision Transformer for Domain Generalization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Though vision transformers (ViTs) have exhibited impressive ability for representation learning, we empirically find that they cannot generalize well to unseen domains with previous domain generalization algorithms. In this paper, we propose a novel approach DoPrompt based on prompt learning to embed the knowledge of source domains in domain prompts for target domain prediction. Specifically, domain prompts are prepended before ViT input tokens from the corresponding source domain. Each domain prompt learns domain-specific knowledge efficiently since it is optimized only for one domain. Meanwhile, we train a prompt adapter to produce a suitable prompt for each input image based on the learned source domain prompts. At test time, the adapted prompt generated by the prompt adapter can exploit the similarity between the feature of the out-of-domain image and source domains to properly integrate the source domain knowledge. Extensive experiments are conducted on four benchmark datasets. Our approach achieves 1.4% improvements in the averaged accuracy, which is 3.5 times the improvement of the state-of-the-art algorithm with a ViT backbone.
Forward citations
Cited by 4 Pith papers
-
DA-MergeLoRA: Hypernetwork-Based LoRA Merging for Few-Shot Test-Time Domain Adaptation
A hypernetwork generates per-column merging weights to combine source LoRA modules on CLIP, achieving state-of-the-art few-shot test-time domain adaptation.
-
Moment Alignment: Unifying Gradient and Hessian Matching for Domain Generalization
A unified moment-alignment theory bounds target-domain error by cross-domain differences in loss derivatives, and the new CMA algorithm implements exact gradient and Hessian matching in closed form.
-
Volume-Distance-Ratio Asymptote and Spacetime Inextendibility for FLRW Spacetimes
The paper derives conditions for past inextendibility of FLRW spacetimes with power-law scale factors using volume-distance-ratio asymptote criteria.
-
Visual Instance-aware Prompt Tuning
ViaPT generates instance-aware prompts per image, fuses them with dataset-level prompts, and applies PCA compression to outperform VPT-Deep and other PEFT baselines on FGVC, HTA, and VTAB-1k.
Discussion (0). Continue with ORCID to comment.