Dynamic Hard Pruning of Neural Networks at the Edge of the Internet
Lorenzo Valerio, Franco Maria Nardini, Andrea Passarella, Raffaele, Perego

TL;DR
This paper introduces Dynamic Hard Pruning (DynHP), a resource-efficient method for training neural networks on constrained devices by incrementally pruning neurons and dynamically adjusting batch sizes to maintain accuracy.
Contribution
The paper presents a novel dynamic pruning technique that reduces network size and memory usage during training, suitable for edge devices, with minimal accuracy loss.
Findings
DynHP compresses networks up to 10 times.
Reduces training memory occupancy by up to 80%.
Maintains accuracy within 3.5% of competitors.
Abstract
Neural Networks (NN), although successfully applied to several Artificial Intelligence tasks, are often unnecessarily over-parametrised. In edge/fog computing, this might make their training prohibitive on resource-constrained devices, contrasting with the current trend of decentralising intelligence from remote data centres to local constrained devices. Therefore, we investigate the problem of training effective NN models on constrained devices having a fixed, potentially small, memory budget. We target techniques that are both resource-efficient and performance effective while enabling significant network compression. Our Dynamic Hard Pruning (DynHP) technique incrementally prunes the network during training, identifying neurons that marginally contribute to the model accuracy. DynHP enables a tunable size reduction of the final neural network and reduces the NN memory occupancy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsPruning
