English

Tent: Fully Test-time Adaptation by Entropy Minimization

Machine Learning 2021-03-19 v3 Computer Vision and Pattern Recognition Machine Learning

Abstract

A model must adapt itself to generalize to new and different data during testing. In this setting of fully test-time adaptation the model has only the test data and its own parameters. We propose to adapt by test entropy minimization (tent): we optimize the model for confidence as measured by the entropy of its predictions. Our method estimates normalization statistics and optimizes channel-wise affine transformations to update online on each batch. Tent reduces generalization error for image classification on corrupted ImageNet and CIFAR-10/100 and reaches a new state-of-the-art error on ImageNet-C. Tent handles source-free domain adaptation on digit recognition from SVHN to MNIST/MNIST-M/USPS, on semantic segmentation from GTA to Cityscapes, and on the VisDA-C benchmark. These results are achieved in one epoch of test-time optimization without altering training.

Keywords

Cite

@article{arxiv.2006.10726,
  title  = {Tent: Fully Test-time Adaptation by Entropy Minimization},
  author = {Dequan Wang and Evan Shelhamer and Shaoteng Liu and Bruno Olshausen and Trevor Darrell},
  journal= {arXiv preprint arXiv:2006.10726},
  year   = {2021}
}

Comments

ICLR 2021 Spotlight

R2 v1 2026-06-23T16:26:40.119Z