Subspace Optimization for Backpropagation-Free Continual Test-Time Adaptation
Not on the map. Why?
Abstract (arXiv)
We introduce PACE, a backpropagation-free continual test-time adaptation system that directly optimizes the affine parameters of normalization layers. Existing derivative-free approaches struggle to balance runtime efficiency with learning capacity, as they either restrict updates to input prompts or require continuous, resource-intensive adaptation regardless of domain stability. To address these limitations, PACE leverages the Covariance Matrix Adaptation Evolution Strategy with the Fastfood projection to optimize high-dimensional affine parameters within a low-dimensional subspace, leading to superior adaptive performance. Furthermore, we enhance the runtime efficiency by incorporating an adaptation stopping criterion and a domain-specialized vector bank to eliminate redundant computation. Our framework achieves state-of-the-art accuracy across multiple benchmarks under continual distribution shifts, reducing runtime by over 50% compared to existing backpropagation-free methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 41 references that are in the map. First posted on arXiv 30 Mar 2026.
Builds on
27 of 41 references.
References · 27
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2022Continual Test-Time Domain Adaptationcited by 520
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 467
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 427
- 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 409
- 2016The CMA Evolution Strategy: A Tutorialcited by 364
- 2020Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shiftcited by 235
- 2014Qualitatively characterizing neural network optimization problemscited by 186
15 more
- 2022Parameter-free Online Test-time Adaptationcited by 184
- 2021PTQ4ViT: Post-training quantization for vision transformers with twin uniform quantizationcited by 173
- 2022NOTE: Robust Continual Test-time Adaptation Against Temporal Correlationcited by 150
- 2022Robust Mean Teacher for Continual and Gradual Test-Time Adaptationcited by 102
- 2023TTN: A Domain-Shift Aware Batch Normalization in Test-Time Adaptationcited by 101
- 2024Test-Time Model Adaptation with Only Forward Passescited by 74
- 2014Fastfood: Approximate Kernel Expansions in Loglinear Timecited by 72
- 2023DELTA: degradation-free fully test-time adaptationcited by 72
- 2021SITA: Single Image Test-time Adaptationcited by 57
- 2022An Efficient Domain-Incremental Learning Approach to Drive in All Weather Conditionscited by 54
- 2024Uncertainty-Calibrated Test-Time Model Adaptation without Forgettingcited by 20
- 2023Persistent Test-time Adaptation in Recurring Testing Scenarioscited by 18
- 2025Test-Time Model Adaptation for Quantized Neural Networkscited by 9
- 2025ReservoirTTA: Prolonged Test-time Adaptation for Evolving and Recurring Domainscited by 8
- 2023Towards Unified and Effective Domain Generalizationcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.