Skip to content

Rethinking the Teacher-Student Framework for Test-Time Adaptation

Sep 2026 · 0 citations · 67 references
Computer Science

TL;DR

This work challenges the common strategy of setting the teacher weights to an exponential moving average of the student by showing that error accumulation still occurs, although it is mostly apparent on longer sequences compared to those commonly utilized, and proposes an intransigent teacher that does not update its weights.

Abstract

Test-Time Adaptation (TTA) has recently emerged as a promising strategy that allows the adaptation of pre-trained models to changing data distributions at deployment time, without access to any labels. To mitigate error accumulation, researchers have widely adopted the teacher-student framework, though its long-term stability is often taken for granted. In this work, we challenge the common strategy of setting the teacher weights to an exponential moving average of the student by showing that error accumulation still occurs, although it is mostly apparent on longer sequences compared to those commonly utilized. We analyze the stability-plasticity trade-off within the teacher-student framework and propose to use an intransigent teacher that does not update its weights. Surprisingly, we show that this simple change allows TTA methods to significantly improve their performance on multiple datasets with longer scenarios and result in increased robustness to changes in hyperparameters. Finally, we show that those changes can be seamlessly and effectively applied to various architectures and experimental setups, including semantic segmentation. The code is available at https://github.com/dmn-sjk/intransigent_teacher.

View source

Similar papers

#machine learning Preprint Sep 2026

To Adapt or Not to Adapt? Selective Adaptation for Vision-Language Models

This work proposes Cross-Augmentation Similarity (CAS), a simple baseline that performs adaptation only when predictions across augmented views exhibit low similarity, which not only preserves but in some cases improves overall accuracy, even when skipping nearly 85% of the adaptation process.

Si-Ru Jiang, Yu-Wei Liang, Jian Liang et al. · 1 citation
Preprint Sep 2026

DESA-TTA: Dynamic EMA and Source Anchoring for Test-Time Adaptation

Vision-language object detectors (VLODs) achieve strong zero-shot performance but remain vulnerable to distribution shifts during deployment. Mean-teacher methods for test-time adaptation (TTA) can improve robustness by updating a student model using teacher-generated pseudo-labels. However, mean-teacher TTA is highly...

Atif Belal, Lilian Hollard, Marco Pedersoli et al. · 0 citations
#machine learning Preprint Sep 2026

UnlearningSoup: Is Repeated Tuning Necessary for Large Language Model Unlearning?

Whether unlearning runs exhibit exploitable structure in weight space is investigated, and it is observed that models from different runs still lie in a shared evaluation-performance basin, suggesting that stronger models may be recovered through an unlearning-tailored soup strategy, reducing the need for repeated tuni...

Pu-Ning Yang, Qi-Zhou Wang, Jun-Chi Yu et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Self-Specialized Teachers for Domain Post-Training

Self-specialized teacher distillation (SSTD), a two-stage procedure that first trains a copy of the base model into a domain teacher, then distills its token distribution to a student on prefixes sampled from the student itself, is proposed.

Yifei Li, Rong-Man Xu, Lingling Zhang et al. · 1 citation
Preprint Aug 2026

Reliable Neural Collapse Approximation for Open-World Test-Time Adaptation

A new method named Reliable Neural Collapse approximation (ReNC) for Open-World Test-Time Adaptation (OWTTA) is introduced, leveraging neural collapse as a structural prior for reliable target-domain adaptation.

Jia-Qi Lin, Yuangang Pan, Chang-Ran Wang et al. · 0 citations
Preprint Aug 2026

Rethinking Expressivity and Efficiency in Test-Time Training

Under the standard approximation of taking gradients at the chunk-start weights, a closed-form state transition is derived that exactly reproduces the chunk-end fast-weight and momentum states of the per-token recurrence of Test-Time Training.

Zeyun Zhong, Joya Chen, Manuel Martín et al. · 2 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.