arXiv Machine Learning By Se Un Park, Kyungkeon Chung, Huigeol Kim, Junyoung Park

Replay Pruning and Few-Bit Integer Inference for Hardware-Efficient Speed-Sign Recognition

Read the original on arXiv Machine Learning →

The paper presents a two‑stage speed‑limit sign recognizer for automotive SoCs that compresses a YOLO‑family detector via channel replay pruning and implements a lightweight five‑layer CNN reader using 4‑bit weights and 8‑bit activations. Replay pruning removes over 60% of parameters while matching parent accuracy, outperforming other pruning methods on YOLOv5n and YOLOv8n. The resulting system, with 0.72 M parameters, achieves 95.2% recognition accuracy at 94 fps on a Jetson AGX Orin, fitting within tight memory, arithmetic, and energy budgets.

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 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
Hugging Face Trending Papers
Jun 10

Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

Neural network pruning reduces model size by removing less important parameters while aiming to preserve predictive performance. Although the Lottery Ticket Hypothesis (LTH) shows that sparse subnetworks can match dense networks when trained from suitable initializations, its iterative pruning procedure requires multiple complete training cycles.