Bag of Tricks for Fully Test-Time Adaptation

Saypraseuth Mounsaveng, Florent Chiaroni, Malik Boudiaf, Marco Pedersoli, Ismail Ben Ayed
10/3/2023
cs.LGcs.CV

Official code: smounsav/tta_bot (10 stars, last commit 2023-10-27).

Abstract

Fully Test-Time Adaptation (TTA), which aims at adapting models to data drifts, has recently attracted wide interest. Numerous tricks and techniques have been proposed to ensure robust learning on arbitrary streams of unlabeled data. However, assessing the true impact of each individual technique and obtaining a fair comparison still constitutes a significant challenge. To help consolidate the community's knowledge, we present a categorization of selected orthogonal TTA techniques, including small batch normalization, stream rebalancing, reliable sample selection, and network confidence calibration. We meticulously dissect the effect of each approach on different scenarios of interest. Through our analysis, we shed light on trade-offs induced by those techniques between accuracy, the computational power required, and model complexity. We also uncover the synergy that arises when combining techniques and are able to establish new state-of-the-art results.

View on arXivView PDF

Code Implementations(1)

smounsav/tta_botOfficial100%

Code for Bag of Tricks for Fully Test-Time Adaptation

100PythonOct 27, 20232 years ago

Similar Papers

Cite this paper

@article{mounsaveng2023tricks,
  title  = {Bag of Tricks for Fully Test-Time Adaptation},
  author = {Saypraseuth Mounsaveng and Florent Chiaroni and Malik Boudiaf and Marco Pedersoli and Ismail Ben Ayed},
  year   = {2023},
  eprint = {2310.02416},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.02416v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.02416.svg)](https://codeofpaper.com/paper/2310.02416)

Discussion