Adapting Without Gradients: Affine Statistics Transport and What Its Certificate Can Tell You
Not on the map. Why?
Abstract (arXiv)
Test-time adaptation (TTA) typically assumes that model parameters can be updated at inference time. This assumption is restrictive for inference-only accelerators, frozen or third-party models, and memory-constrained deployments, and standard BatchNorm-based TTA configurations may also become inactive on architectures without BatchNorm. We study adaptation when the learned model must remain frozen. We introduce CASTER, a gradient-free method that stores source class statistics in a discriminative subspace, estimates a class-shared affine transformation from target-batch moments, and analytically transports the source class distributions before classification. CASTER requires no backward pass, optimizer state, or stored source feature bank. Across four backbones and seven datasets, it outperforms k-NN on identical frozen features in 27 of 28 backbone-dataset settings while retaining a median of 18x less state. Affine transport is not always reliable. On ImageNet-C, where batches contain only 64 samples for 1000 classes, unconditional transport loses 21.2 top-1 points. We therefore introduce an empirical residual-to-margin transportability certificate. Across 307 evaluation cells, every transport losing more than 10 points has certificate value above 3.9, although benign and destructive regimes are not perfectly separated. Gating converts an average -3.35-point effect of unconditional transport into a +1.69-point gain, and performance remains within 0.3 points of the best threshold over a broad threshold range. Finally, we show that this certificate is mechanism-specific: when applied to Tent, it accepts only 4.3% of updates and preserves 0.6% of Tent's available gain. These results position CASTER as a lightweight adaptation mechanism for frozen-model deployment, together with an explicit account of when its safety signal is informative and when it is not.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 18 references that are in the map. First posted on arXiv 31 Aug 2026.
Builds on
13 of 18 references.
References · 13
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
- 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,013
- 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
- 2024Test-Time Model Adaptation with Only Forward Passescited by 74
- 2025Monitoring Risks in Test-Time Adaptationcited by 11
- 2025PolygoNet: Leveraging Simplified Polygonal Representation for Effective Image Classificationcited by 6
- 2026TopoLoRA-SAM: Topology-Aware Parameter-Efficient Adaptation of Foundation Segmenters for Thin-Structure and Cross-Domain Binary Semantic Segmentationcited by 6
1 more
Built on by
Citing papers per year: 2026: 1.
1 paper.