Singular Value Penalization and Semantic Data Augmentation for Fully Test-Time Adaptation
Fully test-time adaptation (FTTA) adapts a model that is trained on a source domain to a target domain during the testing phase, where the two domains follow different distributions and source data is unavailable during the training phase. Existing methods usually adopt entropy minimization to reduce the uncertainty of target prediction results, and improve the FTTA performance accordingly. However, they fail to ensure the diversity in target prediction results. Recent domain adaptation study has shown that maximizing the sum of singular values of prediction results can simultaneously enhance their confidence (discriminability) and diversity. However, during the training phase, larger singular values usually take up a dominant position in loss maximization. This results in the model being more inclined to enhance discriminability for easily distinguishable classes, and the improvement in diversity is insufficiently effective. Furthermore, the adaptation and prediction in FTTA only use data from the current batch, which may lead to the risk of overfitting. To address the aforementioned issues, we propose maximizing the sum of singular values while minimizing their variance. This enables the model's focus toward the smaller singular values, enhancing discriminability between more challenging classes and effectively increasing the diversity of prediction results. Moreover, we incorporate data from the previous batch to realize semantic data augmentation for the current batch, reducing the risk of overfitting. Extensive experiments on benchmark datasets show our proposed approach outperforms some compared state-of-the-art FTTA methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Data AugmentationDiversityDomain AdaptationPredictionTest-time AdaptationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
SpecFormer: Guarding Vision Transformer Robustness via Maximum Singular Value Penalization
Vision Transformers (ViTs) are increasingly used in computer vision due to their high performance, but their vulnerability to adversarial attacks is a concern. Existing methods lack a solid theoretical basis, focusing ma…
Computational EfficiencyTransferability vs. Discriminability: Batch Spectral Penalization for Adversarial Domain Adaptation
Adversarial domain adaptation has made remarkable advances in learning transferable representations for knowledge transfer across domains. While adversarial learning strengthens the feature transferability which the comm…
Domain AdaptationTransfer LearningSpectral Feature Augmentation for Graph Contrastive Learning and Beyond
Although augmentations (e.g., perturbation of graph edges, image crops) boost the efficiency of Contrastive Learning (CL), feature level augmentation is another plausible, complementary yet not well researched strategy. …
Contrastive LearningTest-Time Adaptation with Principal Component Analysis
Machine Learning models are prone to fail when test data are different from training data, a situation often encountered in real applications known as distribution shift. While still valid, the training-time knowledge be…
Test-time AdaptationvalidAddressing Token Uniformity in Transformers via Singular Value Transformation
Token uniformity is commonly observed in transformer-based models, in which different tokens share a large proportion of similar information after going through stacked multiple self-attention layers in a transformer. In…
Semantic Textual Similarity