SNAP: Low-Latency Test-Time Adaptation with Sparse Updates
Not on the map. Why?
Abstract (arXiv)
Test-Time Adaptation (TTA) adjusts models using unlabeled test data to handle dynamic distribution shifts. However, existing methods rely on frequent adaptation and high computational cost, making them unsuitable for resource-constrained edge environments. To address this, we propose SNAP, a sparse TTA framework that reduces adaptation frequency and data usage while preserving accuracy. SNAP maintains competitive accuracy even when adapting based on only 1% of the incoming data stream, demonstrating its robustness under infrequent updates. Our method introduces two key components: (i) Class and Domain Representative Memory (CnDRM), which identifies and stores a small set of samples that are representative of both class and domain characteristics to support efficient adaptation with limited data; and (ii) Inference-only Batch-aware Memory Normalization (IoBMN), which dynamically adjusts normalization statistics at inference time by leveraging these representative samples, enabling efficient alignment to shifting target domains. Integrated with five state-of-the-art TTA algorithms, SNAP reduces latency by up to 93.12%, while keeping the accuracy drop below 3.3%, even across adaptation rates ranging from 1% to 50%. This demonstrates its strong potential for practical use on edge devices serving latency-sensitive applications. The source code is available at https://github.com/chahh9808/SNAP.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 39 of its 54 references that are in the map. First posted on arXiv 19 Nov 2025.
Builds on
39 of 54 references.
References · 39
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2013Visualizing and Understanding Convolutional Networkscited by 2,290
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,013
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
27 more
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
- 2022Continual Test-Time Domain Adaptationcited by 525
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 469
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 431
- 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 415
- 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 377
- 2016Revisiting Batch Normalization For Practical Domain Adaptationcited by 288
- 2020MCUNet: Tiny Deep Learning on IoT Devicescited by 273
- 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
- 2020Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shiftcited by 236
- 2023Robust Test-Time Adaptation in Dynamic Scenarioscited by 189
- 2022NOTE: Robust Continual Test-time Adaptation Against Temporal Correlationcited by 151
- 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
- 2023EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularizationcited by 123
- 2020Characterizing Structural Regularities of Labeled Data in Overparameterized Modelscited by 93
- 2024Test-Time Model Adaptation with Only Forward Passescited by 74
- 2023SoTTA: Robust Test-Time Adaptation on Noisy Data Streamscited by 63
- 2022Adaptive Second Order Coresets for Data-efficient Machine Learningcited by 60
- 2020Batch Normalization Embeddings for Deep Domain Generalizationcited by 57
- 2023Towards a statistical theory of data selection under weak supervisioncited by 27
- 2023Persistent Test-time Adaptation in Recurring Testing Scenarioscited by 18
- 2023Evaluation of Test-Time Adaptation Under Computational Time Constraintscited by 15
- 2024BWS: Best Window Selection Based on Sample Scores for Data Pruning across Broad Rangescited by 8
- 2023COLA: Characterizing and Optimizing the Tail Latency for Safe Level-4 Autonomous Vehicle Systemscited by 3
- 2024Optimal Transport for Domain Adaptation through Gaussian Mixture Modelscited by 3
- 2023Combating the effects of speed and delays in end-to-end self-drivingcited by 2
Built on by
Not cited yet.