mlsanityData to 7 Oct 2026

NEO: No-Optimization Test-Time Adaptation through Latent Re-Centering

arXiv 2510.05635 ↗First posted 7 Oct 2025cs.LG cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

Test-Time Adaptation (TTA) methods are often computationally expensive, require a large amount of data for effective adaptation, or are brittle to hyperparameters. Based on a theoretical foundation of the geometry of the latent space, we are able to significantly improve the alignment between source and distribution-shifted samples by re-centering target data embeddings at the origin. This insight motivates NEO -- a hyperparameter-free fully TTA method, that adds no significant compute compared to vanilla inference. NEO is able to improve the classification accuracy of ViT-Base on ImageNet-C from 55.6% to 59.2% after adapting on just one batch of 64 samples. When adapting on 512 samples NEO beats all 7 TTA methods we compare against on ImageNet-C, ImageNet-R and ImageNet-S and beats 6/7 on CIFAR-10-C, while using the least amount of compute. NEO performs well on model calibration metrics and additionally is able to adapt from 1 class to improve accuracy on 999 other classes in ImageNet-C. On Raspberry Pi and Jetson Orin Nano devices, NEO reduces inference time by 63% and memory usage by 9% compared to baselines. Our results based on 3 ViT architectures and 4 datasets show that NEO can be used efficiently and effectively for TTA.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 26 of its 40 references that are in the map. First posted on arXiv 7 Oct 2025.

Builds on

26 of 40 references.

References · 26

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  2. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  3. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  4. 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,010
  5. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
  6. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
  7. 2022Continual Test-Time Domain Adaptationcited by 520
  8. 2022Efficient Test-Time Model Adaptation without Forgettingcited by 467
  9. 2020Improving robustness against common corruptions by covariate shift adaptationcited by 427
  10. 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 409
  11. 2020Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shiftcited by 235
  12. 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 226
14 more
  1. 2022Parameter-free Online Test-time Adaptationcited by 184
  2. 2022NOTE: Robust Continual Test-time Adaptation Against Temporal Correlationcited by 150
  3. 2020Neural collapse with unconstrained featurescited by 140
  4. 2023EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularizationcited by 123
  5. 2024Test-Time Model Adaptation with Only Forward Passescited by 74
  6. 2023Deep Neural Collapse Is Provably Optimal for the Deep Unconstrained Features Modelcited by 43
  7. 2023Neural Collapse for Unconstrained Feature Model under Cross-entropy Loss with Imbalanced Datacited by 38
  8. 2024Linguistic Collapse: Neural Collapse in (Large) Language Modelscited by 36
  9. 2023Optimization-Free Test-Time Adaptation for Cross-Person Activity Recognitioncited by 15
  10. 2025Controlling Neural Collapse Enhances Out-of-Distribution Detection and Transfer Learningcited by 11
  11. 2023Unraveling Batch Normalization for Realistic Test-Time Adaptationcited by 10
  12. 2025E-BATS: Efficient Backpropagation-Free Test-Time Adaptation for Speech Foundation Modelscited by 8
  13. 2025SURGEON: Memory-Adaptive Fully Test-Time Adaptation via Dynamic Activation Sparsitycited by 7
  14. 2025BoTTA: Benchmarking on-device Test Time Adaptationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 7.

7 papers.