UnIT: Scalable Unstructured Inference-Time Pruning for MAC-efficient Neural Inference on MCUs
Not on the map. Why?
Abstract (arXiv)
Existing pruning methods are typically applied during training or compile time and often rely on structured sparsity. While compatible with low-power microcontrollers (MCUs), structured pruning underutilizes the opportunity for fine-grained efficiency on devices without SIMD support or parallel compute. To address these limitations, we introduce UnIT (Unstructured Inference-Time pruning), a lightweight method that dynamically identifies and skips unnecessary multiply-accumulate (MAC) operations during inference, guided by input-specific activation patterns. Unlike structured pruning, UnIT embraces irregular sparsity and does not require retraining or hardware specialization. It transforms pruning decisions into lightweight comparisons, replacing multiplications with threshold checks and approximated divisions. UnIT further optimizes compute by reusing threshold computations across multiple connections and applying layer- and group-specific pruning sensitivity. We present three fast, hardware-friendly division approximations tailored to the capabilities of common embedded platforms. Demonstrated on the MSP430 microcontroller, UnIT achieves 11.02% to 82.03% MAC reduction, 27.30% to 84.19% faster inference, and 27.33% to 84.38% lower energy consumption compared to training-time pruned models, while maintaining accuracy with 0.48-7%. Under domain shift, UnIT matches or exceeds the accuracy of retrained models while requiring significantly fewer MACs. These results establish unstructured inference-time pruning as a viable and practical solution for efficient, retraining-free deployment of deep neural networks on MCUs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 42 references that are in the map. First posted on arXiv 10 Jul 2025.
Builds on
22 of 42 references.
References · 22
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 752
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2018Rethinking the Value of Network Pruningcited by 599
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 301
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
10 more
- 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 215
- 2015Structured Pruning of Deep Convolutional Neural Networkscited by 149
- 2018NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applicationscited by 147
- 2021When to Prune? A Policy towards Early Structural Pruningcited by 38
- 2018Intelligence Beyond the Edge: Inference on Intermittent Embedded Systemscited by 25
- 2020Learned Threshold Pruningcited by 17
- 2019Structured Compression by Weight Encryption for Unstructured Pruning and Quantizationcited by 16
- 2014Zero-bias autoencoders and the benefits of co-adapting featurescited by 15
- 2023Automatic Attention Pruning: Improving and Automating Model Pruning using Attentionscited by 11
- 2020Channel Pruning via Optimal Thresholdingcited by 2
Built on by
Not cited yet.