Layer-wise Auto-Weighting for Non-Stationary Test-Time Adaptation
Junyoung Park, Jin Kim, Hyeongjun Kwon, Ilhoon Yoon, Kwanghoon Sohn

TL;DR
This paper proposes a layer-wise auto-weighting method using Fisher Information to improve test-time adaptation in non-stationary environments, reducing computational load and preventing catastrophic forgetting.
Contribution
It introduces a novel FIM-based auto-weighting algorithm for continual TTA that selectively adapts layers, enhancing efficiency and robustness against domain shifts.
Findings
Outperforms existing TTA methods on CIFAR-10C, CIFAR-100C, and ImageNet-C.
Reduces computational load significantly compared to traditional approaches.
Effectively mitigates catastrophic forgetting and error accumulation.
Abstract
Given the inevitability of domain shifts during inference in real-world applications, test-time adaptation (TTA) is essential for model adaptation after deployment. However, the real-world scenario of continuously changing target distributions presents challenges including catastrophic forgetting and error accumulation. Existing TTA methods for non-stationary domain shifts, while effective, incur excessive computational load, making them impractical for on-device settings. In this paper, we introduce a layer-wise auto-weighting algorithm for continual and gradual TTA that autonomously identifies layers for preservation or concentrated adaptation. By leveraging the Fisher Information Matrix (FIM), we first design the learning weight to selectively focus on layers associated with log-likelihood changes while preserving unrelated ones. Then, we further propose an exponential min-max scaler…
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
Layer-Wise Auto-Weighting for Non-Stationary Test-Time Adaptation· youtube
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning
MethodsFocus
