arXiv Machine Learning By Francesco Corti, Moritz Becker, Olga Saukh

No Frames, Just Frequencies: Bandwidth-Efficient Deployment-Time Adaptation for Smart Glasses

Read the original on arXiv Machine Learning →

The paper introduces "No Frames, Just Frequencies," a bandwidth‑efficient adaptation framework for smart glasses that uses on‑device frequency descriptors instead of camera frames to detect distribution shifts. These descriptors are sent to a host device, which generates out‑of‑distribution data and adapts a model replica via a predefined protocol. Experiments on ImageNet‑C corruptions, Visual Wake Words, and MS‑COCO show that descriptor‑driven adaptation recovers 93‑95% of supervised oracle gains, with graceful degradation as descriptor resolution drops, enabling up to 784× bandwidth savings.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Computer Vision
Oct 9

RT-DETRv4: Painlessly Furthering Real-Time Object Detection with Vision Foundation Models

RT-DETRv4 introduces a cost‑effective distillation framework that leverages Vision Foundation Models to improve lightweight real‑time object detectors. The method uses a Deep Semantic Injector to embed high‑level VFM representations into deep detector layers and a Gradient‑guided Adaptive Modulation strategy to adjust semantic transfer intensity based on gradient norms. These techniques yield consistent performance gains across DETR‑based models without adding inference overhead, achieving state‑of‑the‑art COCO AP scores at high FPS.

By Zijun Liao, Yian Zhao, Xin Shan, Yu Yan, Chang Liu, Lei Lu, Xiangyang Ji, Jie Chen
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 Computer Vision
Aug 24

Continual Test-Time Adaptation in Computer Vision: Methods, Benchmarks, and Future Directions

The paper surveys Continual Test-Time Adaptation (CTTA), a framework that adapts pretrained computer‑vision models to non‑stationary target distributions without source data or labeled targets, while avoiding catastrophic forgetting and error accumulation. It formally defines the CTTA problem, categorizes existing methods into optimization‑based, parameter‑efficient, and architecture‑based families, and reviews representative techniques and benchmarks across standard evaluation settings. The survey also outlines current limitations and proposes future research directions, such as adapting foundation models and black‑box systems.

By Sarthak Kumar Maharana, Shambhavi Mishra, Yunbei Zhang, Shuaicheng Niu, Taki Hasan Rafi, Jihun Hamm, Marco Pedersoli, Jose Dolz, Yunhui Guo