Uncover and Unlearn Nuisances: Agnostic Fully Test-Time Adaptation
Ponhvoan Srey, Yaxin Shi, Hangwei Qian, Jing Li, Ivor W. Tsang
TL;DR
This work tackles Fully Test-Time Adaptation (FTTA) under the practical constraint of no access to source data or training protocols. It introduces Agnostic FTTA (AFTTA) and a concrete implementation, TIRNU, which uncovers plausible nuisance shifts via off-the-shelf augmentations and then unlearns their influence through a mutual-information objective in the feature space, complemented by a label-consistency regularizer. A variational perspective motivates the approach, modeling domain shifts as latent nuisances and employing a surrogate distribution over transformations for robust prediction. Empirical results across diverse domain shifts—corruptions, natural/adversarial changes, and style transfer—demonstrate that TIRNU outperforms strong baselines and achieves state-of-the-art or competitive performance, albeit with higher computational cost due to augmentation and MI estimation. The method offers a flexible framework for incorporating domain-shift priors into FTTA, opening avenues for tailored nuisance priors and broader applications in domain adaptation under data access constraints.
Abstract
Fully Test-Time Adaptation (FTTA) addresses domain shifts without access to source data and training protocols of the pre-trained models. Traditional strategies that align source and target feature distributions are infeasible in FTTA due to the absence of training data and unpredictable target domains. In this work, we exploit a dual perspective on FTTA, and propose Agnostic FTTA (AFTTA) as a novel formulation that enables the usage of off-the-shelf domain transformations during test-time to enable direct generalization to unforeseeable target data. To address this, we develop an uncover-and-unlearn approach. First, we uncover potential unwanted shifts between source and target domains by simulating them through predefined mappings and consider them as nuisances. Then, during test-time prediction, the model is enforced to unlearn these nuisances by regularizing the consequent shifts in latent representations and label predictions. Specifically, a mutual information-based criterion is devised and applied to guide nuisances unlearning in the feature space and encourage confident and consistent prediction in label space. Our proposed approach explicitly addresses agnostic domain shifts, enabling superior model generalization under FTTA constraints. Extensive experiments on various tasks, involving corruption and style shifts, demonstrate that our method consistently outperforms existing approaches.
