Source-Free Controlled Adaptation of Teachers for Continual Test-Time Adaptation
arXiv:2607. 23735v1 Announce Type: new Abstract: In many real-world scenarios, encountering continual shifts in domain during inference is very common.
The paper investigates the teacher‑student framework used in Test‑Time Adaptation (TTA) and questions the common practice of updating the teacher via an exponential moving average of the student. The authors demonstrate that error accumulation still occurs, especially over longer sequences, and propose an intransigent teacher that remains fixed. This modification yields significant performance gains across multiple datasets, longer scenarios, and various architectures, including semantic segmentation, while also improving robustness to hyperparameter changes.
arXiv:2607. 23735v1 Announce Type: new Abstract: In many real-world scenarios, encountering continual shifts in domain during inference is very common.
DESA‑TTA introduces a low‑overhead test‑time adaptation technique for vision‑language object detectors that dynamically adjusts the teacher’s exponential moving average coefficient based on pseudo‑label confidence and box density. It also employs source anchoring to gradually pull student parameters back toward their pretrained values, mitigating cumulative drift. Experiments on multiple distribution shifts and two VLOD architectures demonstrate consistent gains, with a 14.5‑point AP₅₀ improvement on VOC‑C and a 55% higher inference throughput compared to the prior state‑of‑the‑art TTA method for YOLO‑World.
arXiv:2511. 18468v2 Announce Type: replace Abstract: Continual Test-Time Adaptation (CTTA) is crucial for deploying models in real-world applications with unseen, evolving target domains.
Deep neural nets achieve remarkable performance when training and test data share the same distribution, but this assumption frequently breaks in real-world deployment, where data undergoes continual distributional shifts. Continual Test-Time Adaptation (CTTA) addresses this challenge by adapting pretrained models to non-stationary target distributions on-the-fly, without access to source data or labeled targets, while mitigating two critical failure modes: catastrophic forgetting of source knowledge and error accumulation from noisy pseudo-labels over extended time horizons.
arXiv:2606. 31420v1 Announce Type: new Abstract: Test-Time Adaptation (TTA) enables models trained on a source domain to adapt online to unlabeled test data under distribution shifts.
arXiv:2608. 01672v1 Announce Type: cross Abstract: Effective long-context modeling is not merely about retaining more of the past, but about preserving the information that may prove relevant later.
arXiv:2609.37687v1 Announce Type: new Abstract: Active test-time adaptation (ATTA) improves robustness under distribution shift by updating a deployed model during inference while selectively queryin...
The paper introduces DGOTTA, a framework for temporal memory‑aware online test‑time adaptation on dynamic graphs. DGOTTA comprises three modules: temporal‑aware augmentation to diversify test graphs, memory‑aware model prediction to mitigate catastrophic forgetting, and consistency‑guided online adaptation to enforce temporal alignment and smoothness. Experiments on three real‑world datasets and four DGNN backbones show that DGOTTA improves generalization under diverse distribution shifts and across multiple model architectures.
arXiv:2601.22628v3 Announce Type: replace-cross Abstract: Test-Time Training offers a promising way to improve the reasoning ability of large language models (LLMs) by adapting the model using only t...
This paper introduces TestDG, an online test-time domain generalization framework for continual test-time adaptation (CTTA). TestDG learns features invariant to both current and past test domains during testing, using a new model architecture, adaptation strategy, and prototype selection/update mechanisms. It achieves state‑of‑the‑art results on four CTTA benchmarks and demonstrates superior generalization to unseen test domains.
The paper introduces query‑conditioned hypernetworks that predict distributions over LoRA weight updates for large language models. By learning a distribution rather than a single point estimate, the method allows sampling multiple adapted models for the same query, improving performance over deterministic hypernetworks and token‑sampling baselines. The study also shows that these learned updates can transfer across different queries, indicating reusable adaptation patterns.
arXiv:2608. 01074v1 Announce Type: new Abstract: Tabular data is used extensively in many real-world use cases.