Singular Value Penalization and Semantic Data Augmentation for Fully Test-Time Adaptation
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 30 references that are in the map. First posted on arXiv 10 Dec 2023.
Builds on
25 of 30 references.
References · 25
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2016Wide Residual Networkscited by 3,070
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
- 2017Deeper, Broader and Artier Domain Generalizationcited by 986
- 2018Deep Visual Domain Adaptation: A Surveycited by 635
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 469
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 431
- 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 415
13 more
- 2019Contrastive Adaptation Network for Unsupervised Domain Adaptationcited by 407
- 2020Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shiftcited by 236
- 2020Universal Source-Free Domain Adaptationcited by 220
- 2022Parameter-free Online Test-time Adaptationcited by 189
- 2021Generalized Source-free Domain Adaptationcited by 175
- 2021Source-Free Domain Adaptation for Semantic Segmentationcited by 168
- 2021The Norm Must Go On: Dynamic Unsupervised Domain Adaptation by Normalizationcited by 131
- 2022SePiCo: Semantic-Guided Pixel Contrast for Domain Adaptive Semantic Segmentationcited by 87
- 2020Regularizing Deep Networks with Semantic Data Augmentationcited by 73
- 2023DELTA: degradation-free fully test-time adaptationcited by 72
- 2022Unsupervised Domain Adaptation for Nighttime Aerial Trackingcited by 56
- 2021PRIME: A few primitives can boost robustness to common corruptionscited by 40
- 2023Neuro-Modulated Hebbian Learning for Fully Test-Time Adaptationcited by 23
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.