aiqbench analysis
This research introduces OD-TTA, a resource-efficient framework for embodied visual systems that adapts models only upon detecting significant domain shifts. By employing lightweight detection mechanisms and decoupled Batch Normalization updates, the method drastically reduces memory overhead and energy consumption on edge devices while maintaining robust accuracy. This advancement makes continual test-time adaptation practically viable for real-world deployment in constrained environments.
EmbodiTTA: Resource-Efficient Test-Time Adaptation for Embodied Visual Systems
arXiv:2505.00986v4 Announce Type: replace Abstract: Continual Test-time adaptation (CTTA) continuously adapts the deployed model on every incoming batch of data. While achieving optimal accuracy, existing CTTA approaches present poor real-world applicability on resource-constrained edge devices, due to the substantial memory overhead and energy consumption. In this work, we first introduce a novel paradigm -- on-demand TTA -- which triggers adaptation only when a significant domain shift is detected. Then, we present OD-TTA, an on-demand TTA framework for accurate and efficient adaptation on edge devices. OD-TTA comprises three innovative techniques: 1) a lightweight domain shift detection mechanism to activate TTA only when it is needed, drastically reducing the overall computation overhead, 2) a source domain selection module that chooses an appropriate source model for adaptation, ensuring high and robust accuracy, 3) a decoupled Batch Normalization (BN) update scheme to enable memory-efficient adaptation with small batch sizes. Extensive experiments show that OD-TTA achieves comparable and even better performance while reducing the energy and computation overhead remarkably, making TTA a practical reality.
Abstract:Continual Test-time adaptation (CTTA) continuously adapts the deployed model on every incoming batch of data. While achieving optimal accuracy, existing CTTA approaches present poor real-world applicability on resource-constrained edge devices, due to the substantial memory overhead and energy consumption. In this work, we first introduce a novel paradigm -- on-demand TTA -- which triggers adaptation only when a significant domain shift is detected. Then, we present OD-TTA, an on-demand TTA framework for accurate and efficient adaptation on edge devices. OD-TTA comprises three innovative techniques: 1) a lightweight domain shift detection mechanism to activate TTA only when it is needed, drastically reducing the overall computation overhead, 2) a source domain selection module that chooses an appropriate source model for adaptation, ensuring high and robust accuracy, 3) a decoupled Batch Normalization (BN) update scheme to enable memory-efficient adaptation with small batch sizes. Extensive experiments show that OD-TTA achieves comparable and even better performance while reducing the energy and computation overhead remarkably, making TTA a practical reality.
Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)
arXiv:2505.00986 [cs.LG]
(or arXiv:2505.00986v4 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2505.00986 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 262 words
Related coverage
EmbodiTTA: Resource-Efficient Test-Time Adaptation for Embodied Visual Systems
arXiv · Jun 17, 2026

Amazon Research Awards recipients announced
Amazon Science · May 27, 2026

Build a Physical AI model factory with NVIDIA Cosmos 3 on SageMaker HyperPod
AWS · Sep 4, 2026

Humanity’s Last Invention — Richard Socher of Recursive
Latent Space · Sep 14, 2026