The Golden Subspace: Where Efficiency Meets Generalization in Continual Test-Time Adaptation
Not on the map. Why?
Abstract (arXiv)
Continual Test-Time Adaptation (CTTA) aims to enable models to adapt online to unlabeled data streams under distribution shift without accessing source data. Existing CTTA methods face an efficiency-generalization trade-off: updating more parameters improves adaptation but severely reduces online inference efficiency. An ideal solution is to achieve comparable adaptation with minimal feature updates; we call this minimal subspace the golden subspace. We prove its existence in a single-step adaptation setting and show that it coincides with the row space of the pretrained classifier. To enable online maintenance of this subspace, we introduce the sample-wise Average Gradient Outer Product (AGOP) as an efficient proxy for estimating the classifier weights without retraining. Building on these insights, we propose Guided Online Low-rank Directional adaptation (GOLD), which uses a lightweight adapter to project features onto the golden subspace and learns a compact scaling vector while the subspace is dynamically updated via AGOP. Extensive experiments on classification and segmentation benchmarks, including autonomous-driving scenarios, demonstrate that GOLD attains superior efficiency, stability, and overall performance. Our code is available at https://github.com/AIGNLAI/GOLD.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 4 of its 57 references that are in the map. First posted on arXiv 23 Mar 2026.
Builds on
4 of 57 references.
References · 4
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2020Tent: Fully Test-time Adaptation by Entropy Minimizationcited by 69
- 2024Emergence in non-neural models: grokking modular arithmetic via average gradient outer productcited by 28
- 2024Less is More: Pseudo-Label Filtering for Continual Test-Time Adaptationcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.