arXiv Machine Learning

EmbodiTTA: Resource-Efficient Test-Time Adaptation for Embodied Visual Systems

arXiv:2505. 00986v3 Announce Type: replace Abstract: Continual Test-time adaptation (CTTA) continuously adapts the deployed model on every incoming batch of data.

arXiv AI
Oct 19

LeanTTA: A Backpropagation-Free and Stateless Approach to Quantized Test-Time Adaptation on Edge Devices

LeanTTA is a backpropagation-free, stateless framework for quantized test-time adaptation designed for edge devices. It updates normalization statistics on the fly, avoiding large batches and historical data, and combines partial adaptation with quantized module fusion to reduce computational costs. Experiments across sensor modalities show a 15.7% error reduction, peak memory usage of only 11.2 MB for ResNet18, and fast adaptation within an order of magnitude of normal inference speeds on-device.

By Cynthia Dong, Hong Jia, Young D. Kwon, Georgios Rizos, Cecilia Mascolo
arXiv Computer Vision
4d ago

Tail Cues, Principal Corrections: Plug-and-Play Rectification for Open-Set Test-Time Adaptation

Tail Cues, Principal Corrections: Plug-and-Play Rectification for Open-Set Test-Time Adaptation introduces TALOR, a lightweight module that rectifies features for non-stationary target streams by decomposing them into high-gain principal and low-gain tail coordinates. TALOR applies a soft-routed affine correction in the principal subspace, subtracts drift via weighted ridge regression, and reconstructs the feature for the source head. On ImageNet-C with six csOOD datasets, TALOR surpasses the next-best UniEnt by 2.2% H-score, runs 2.5× faster, and uses only 12% of its GPU memory, while also boosting COME to 68.4% H-score with minimal memory overhead.

By Yingkai Yang, Chaoqi Chen, Hui Huang
arXiv Machine Learning
Sep 3

FORGE: Forward-Only Test-Time Adaptation for Integer-Only Vision Models on Microcontrollers

FORGE is a forward‑only test‑time adaptation technique designed for integer‑only vision models running on microcontrollers. It restores batch‑normalization statistics after BN folding by re‑normalizing each convolution’s per‑channel output using only forward‑pass estimates, enabling adaptation on deployed, folded integer models. The method achieves accuracy gains comparable to gradient‑based TENT, requires adapting only a few layers, works with single‑sample streaming, and has been validated on an ESP32‑S3 with minimal energy and latency overhead.

By Muhammad Rehan, Haider Ali, Muhammad Ali Munir, Moaz Amjad
arXiv AI
Sep 15

OpWeave: Flexible Operator Disaggregation for Heterogeneous LLM Serving

arXiv:2609.14237v1 Announce Type: cross Abstract: LLM serving systems increasingly disaggregate inference into finer-grained stages, with recent approaches separating attention from FFN or MoE execut...

By Zikun Li, Yixuan Mei, Shiqi Pan, Zixuan Chen, Xiaowen Zhang, Mengdi Wu, Shuhuai Lin, Yutong Yang, Zhihao Zhang, Xupeng Miao, Rashmi Vinayak, Zhihao Jia
arXiv AI
Oct 7

Test-Time Adaptation of Quantized ViTs via Single-Pass Quantizer-Aligned Recalibration

The paper introduces Quantizer‑Aligned Recalibration (QuAR), a single‑pass test‑time adaptation technique for quantized vision transformers that does not require backpropagation or parameter updates. QuAR recalibrates activations at the input of frozen quantizers by aligning per‑channel statistics with the source calibration, thereby correcting the distorted code distribution caused by distribution shift. On ImageNet‑C, QuAR outperforms state‑of‑the‑art backprop‑free methods across 3‑, 4‑, 6‑, and 8‑bit precisions, achieving higher accuracy, lower latency, and minimal memory overhead while maintaining performance across diverse shift scenarios.

By Hyeongheon Cha, Young D. Kwon, Sung-Ju Lee