Realistic Evaluation of Test-Time Adaptation Algorithms: Unsupervised Hyperparameter Selection
Test-Time Adaptation (TTA) has recently emerged as a promising strategy for tackling the problem of machine learning model robustness under distribution shifts by adapting the model during inference without access to any labels. Because of task difficulty, hyperparameters strongly influence the effectiveness of adaptation. However, the literature has provided little exploration into optimal hyperparameter selection. In this work, we tackle this problem by evaluating existing TTA methods using surrogate-based hp-selection strategies (which do not assume access to the test labels) to obtain a more realistic evaluation of their performance. We show that some of the recent state-of-the-art methods exhibit inferior performance compared to the previous algorithms when using our more realistic evaluation setup. Further, we show that forgetting is still a problem in TTA as the only method that is robust to hp-selection resets the model to the initial state at every step. We analyze different types of unsupervised selection strategies, and while they work reasonably well in most scenarios, the only strategies that work consistently well use some kind of supervision (either by a limited number of annotated test samples or by using pretraining data). Our findings underscore the need for further research with more rigorous benchmarking by explicitly stating model selection strategies, to facilitate which we open-source our code.
Code (0)
등록된 구현이 없습니다.
Tasks
BenchmarkingModel SelectionTest-time AdaptationSimilar Papers 제목 키워드 기반
Realistic Test-Time Adaptation of Vision-Language Models
The zero-shot capabilities of Vision-Language Models (VLMs) have been widely leveraged to improve predictive performance. However, previous works on transductive or test-time adaptation (TTA) often make strong assumption…
Test-time AdaptationA Systematic Evaluation of Domain Adaptation Algorithms On Time Series Data
Unsupervised domain adaptation methods aim to generalize well on unlabeled test data that may have a different (shifted) distribution from the training data. Such methods are typically developed on image data, and their …
BenchmarkingDomain AdaptationModel SelectionTime Series+2Better Practices for Domain Adaptation
Distribution shifts are all too common in real-world applications of machine learning. Domain adaptation (DA) aims to address this by providing various frameworks for adapting models to the deployment data without using …
BenchmarkingDomain AdaptationSource-Free Domain AdaptationTest-time Adaptation+1Evaluation of Test-Time Adaptation Under Computational Time Constraints
This paper proposes a novel online evaluation protocol for Test Time Adaptation (TTA) methods, which penalizes slower methods by providing them with fewer samples for adaptation. TTA methods leverage unlabeled data at te…
Test-time AdaptationDHAuDS: A Dynamic and Heterogeneous Audio Benchmark for Test-Time Adaptation
Existing Test-time Adaptation (TTA) studies rely heavily on static and homogeneous corruption protocols, such as ImageNet-C and CIFAR-10-C/100-C, leading to inconsistent evaluation settings and potentially inflated robus…
Test-time AdaptationAudio Classification