paper-with-me

홈 › Papers

Singular Value Penalization and Semantic Data Augmentation for Fully Test-Time Adaptation

2023-12-10 · Houcheng Su, Daixian Liu, Mengzhu Wang, Wei Wang

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.

📄 PDF Abstract BibTeX arXiv:2312.08378

Code (0)

등록된 구현이 없습니다.

Tasks

Data AugmentationDiversityDomain AdaptationPredictionTest-time Adaptation

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

SpecFormer: Guarding Vision Transformer Robustness via Maximum Singular Value Penalization

2024-01-02 · Xixu Hu, Runkai Zheng, Jindong Wang, Cheuk Hang Leung 외

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 Efficiency

Transferability vs. Discriminability: Batch Spectral Penalization for Adversarial Domain Adaptation

2019-06-01 · International Conference on Machine Learning 2019 6 · Xinyang Chen, Sinan Wang, Mingsheng Long, Jianmin Wang

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 Learning

Spectral Feature Augmentation for Graph Contrastive Learning and Beyond

2022-12-02 · Yifei Zhang, Hao Zhu, Zixing Song, Piotr Koniusz 외

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 Learning

Test-Time Adaptation with Principal Component Analysis

2022-09-13 · Thomas Cordier, Victor Bouvier, Gilles Hénaff, Céline Hudelot

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 Adaptationvalid

Addressing Token Uniformity in Transformers via Singular Value Transformation

2022-08-24 · Hanqi Yan, Lin Gui, Wenjie Li, Yulan He

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