Enhanced Online Test-time Adaptation with Feature-Weight Cosine Alignment
Not on the map. Why?
Abstract (arXiv)
Online Test-Time Adaptation (OTTA) has emerged as an effective strategy to handle distributional shifts, allowing on-the-fly adaptation of pre-trained models to new target domains during inference, without the need for source data. We uncovered that the widely studied entropy minimization (EM) method for OTTA, suffers from noisy gradients due to ambiguity near decision boundaries and incorrect low-entropy predictions. To overcome these limitations, this paper introduces a novel cosine alignment optimization approach with a dual-objective loss function that refines the precision of class predictions and adaptability to novel domains. Specifically, our method optimizes the cosine similarity between feature vectors and class weight vectors, enhancing the precision of class predictions and the model's adaptability to novel domains. Our method outperforms state-of-the-art techniques and sets a new benchmark in multiple datasets, including CIFAR-10-C, CIFAR-100-C, ImageNet-C, Office-Home, and DomainNet datasets, demonstrating high accuracy and robustness against diverse corruptions and domain shifts.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 38 references that are in the map. First posted on arXiv 12 May 2024.
Builds on
28 of 38 references.
References · 28
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 897
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2014Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Imagescited by 774
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2021Domain Generalization: A Surveycited by 760
- 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 682
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 467
- 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 409
16 more
- 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 376
- 2023A Comprehensive Survey on Test-Time Adaptation under Distribution Shiftscited by 353
- 2022Contrastive Test-Time Adaptationcited by 258
- 2021The Norm Must Go On: Dynamic Unsupervised Domain Adaptation by Normalizationcited by 131
- 2022B-cos Networks: Alignment is All We Need for Interpretabilitycited by 88
- 2023On Pitfalls of Test-Time Adaptationcited by 63
- 2018Decoupled Networkscited by 45
- 2022Robust Multi-Task Learning and Online Refinement for Spacecraft Pose Estimation across Domain Gapcited by 44
- 2023In Search of Lost Online Test-time Adaptation: A Surveycited by 43
- 2022ActMAD: Activation Matching to Align Distributions for Test-Time-Trainingcited by 38
- 2021Test time Adaptation through Perturbation Robustnesscited by 28
- 2022Robustifying Vision Transformer without Retraining from Scratch by Test-Time Class-Conditional Feature Alignmentcited by 26
- 2023Neuro-Modulated Hebbian Learning for Fully Test-Time Adaptationcited by 23
- 2022CAFA: Class-Aware Feature Alignment for Test-Time Adaptationcited by 21
- 2023Temporal Coherent Test-Time Optimization for Robust Video Classificationcited by 15
- 2023Single Domain Generalization via Normalised Cross-correlation Based Convolutionscited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.