PAID: Pairwise Angular-Invariant Decomposition for Continual Test-Time Adaptation
Not on the map. Why?
Abstract (arXiv)
Continual Test-Time Adaptation (CTTA) aims to online adapt a pre-trained model to changing environments during inference. Most existing methods focus on exploiting target data, while overlooking another crucial source of information, the pre-trained weights, which encode underutilized domain-invariant priors. This paper takes the geometric attributes of pre-trained weights as a starting point, systematically analyzing three key components: magnitude, absolute angle, and pairwise angular structure. We find that the pairwise angular structure remains stable across diverse corrupted domains and encodes domain-invariant semantic information, suggesting it should be preserved during adaptation. Based on this insight, we propose PAID (Pairwise Angular-Invariant Decomposition), a prior-driven CTTA method that decomposes weight into magnitude and direction, and introduces a learnable orthogonal matrix via Householder reflections to globally rotate direction while preserving the pairwise angular structure. During adaptation, only the magnitudes and the orthogonal matrices are updated. PAID achieves consistent improvements over recent SOTA methods on four widely used CTTA benchmarks, demonstrating that preserving pairwise angular structure offers a simple yet effective principle for CTTA.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 64 of its 83 references that are in the map. First posted on arXiv 3 Jun 2025.
Builds on
64 of 83 references.
References · 64
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,940
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2022Visual Prompt Tuningcited by 1,681
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2020Image Segmentation Using Deep Learning: A Surveycited by 660
- 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
- 2021ImageNet-21K Pretraining for the Massescited by 613
- 2020FDA: Fourier Domain Adaptation for Semantic Segmentationcited by 541
38 more
- 2019Object Detection in 20 Years: A Surveycited by 531
- 2022Continual Test-Time Domain Adaptationcited by 525
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 469
- 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 415
- 2022Test-Time Prompt Tuning for Zero-Shot Generalization in Vision-Language Modelscited by 382
- 2021Learning How to Ask: Querying LMs with Mixtures of Soft Promptscited by 377
- 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 377
- 2023A Comprehensive Survey on Test-Time Adaptation under Distribution Shiftscited by 359
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
- 2021A Fourier-based Framework for Domain Generalizationcited by 290
- 2022Contrastive Test-Time Adaptationcited by 261
- 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 208
- 2023Robust Test-Time Adaptation in Dynamic Scenarioscited by 189
- 2018Progressive Feature Alignment for Unsupervised Domain Adaptationcited by 183
- 2021FSDR: Frequency Space Domain Randomization for Domain Generalizationcited by 164
- 2022NOTE: Robust Continual Test-time Adaptation Against Temporal Correlationcited by 151
- 2020Harmonizing Transferability and Discriminability for Adapting Object Detectorscited by 126
- 2023EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularizationcited by 123
- 2022Decorate the Newcomers: Visual Domain Prompt for Continual Test Time Adaptationcited by 98
- 2022Visual Prompt Tuning for Test-time Domain Adaptationcited by 97
- 2018Learning towards Minimum Hyperspherical Energycited by 75
- 2024Test-Time Model Adaptation with Only Forward Passescited by 74
- 2023DELTA: degradation-free fully test-time adaptationcited by 72
- 2021Amplitude-Phase Recombination: Rethinking Robustness of Convolutional Neural Networks in Frequency Domaincited by 71
- 2023Universal Test-time Adaptation through Weight Ensembling, Diversity Weighting, and Prior Correctioncited by 65
- 2022Test-Time Adaptation via Self-Training with Nearest Neighbor Informationcited by 64
- 2023SoTTA: Robust Test-Time Adaptation on Noisy Data Streamscited by 63
- 2024Beyond Model Adaptation at Test Time: A Surveycited by 59
- 2023ViDA: Homeostatic Visual Domain Adapter for Continual Test Time Adaptationcited by 58
- 2017Deep Hyperspherical Learningcited by 55
- 2018Decoupled Networkscited by 45
- 2020Orthogonal Over-Parameterized Trainingcited by 44
- 2023In Search of Lost Online Test-time Adaptation: A Surveycited by 44
- 2022Deep Frequency Filtering for Domain Generalizationcited by 43
- 2023Feature Alignment and Uniformity for Test Time Adaptationcited by 42
- 2022ActMAD: Activation Matching to Align Distributions for Test-Time-Trainingcited by 41
- 2021Feature Stylization and Domain-aware Contrastive Learning for Domain Generalizationcited by 40
- 2023Efficient Adaptation of Large Vision Transformer via Adapter Re-Composingcited by 35
50 most cited of 64 All 64 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.