Efficient Test-Time Model Adaptation without Forgetting
Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Yaofo Chen and, Shijian Zheng, Peilin Zhao, Mingkui Tan

TL;DR
This paper introduces a novel test-time adaptation method that selectively updates models using reliable samples, reducing computational costs and preventing catastrophic forgetting in changing environments.
Contribution
It proposes an active sample selection strategy and Fisher regularizer to improve test-time adaptation efficiency and stability without requiring backward computation for each sample.
Findings
Effective in reducing adaptation cost
Prevents catastrophic forgetting
Improves performance on out-of-distribution data
Abstract
Test-time adaptation (TTA) seeks to tackle potential distribution shifts between training and testing data by adapting a given model w.r.t. any testing sample. This task is particularly important for deep models when the test environment changes frequently. Although some recent attempts have been made to handle this task, we still face two practical challenges: 1) existing methods have to perform backward computation for each test sample, resulting in unbearable prediction cost to many applications; 2) while existing TTA solutions can significantly improve the test performance on out-of-distribution data, they often suffer from severe performance degradation on in-distribution data after TTA (known as catastrophic forgetting). In this paper, we point out that not all the test samples contribute equally to model adaptation, and high-entropy ones may lead to noisy gradients that could…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · COVID-19 diagnosis using AI · Advanced Neural Network Applications
