Valerio L., Nardini F. M., Passarella A., Perego R.
Artificial neural networks Compression Pruning Resource-constrained devices
Neural Networks (NN), although successfully applied to several Artificial Intelligence tasks, are often unnecessarily over-parametrized. In fog/edge 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 technique, called Dynamic Hard Pruning (DynHP), 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 during training. Freed memory is reused by a\emph {dynamic batch sizing} approach to counterbalance the accuracy degradation caused by the hard pruning strategy, improving its convergence and effectiveness. We assess the performance of DynHP through reproducible experiments on two public datasets, comparing them against reference competitors. Results show that DynHP compresses a NN up to times without significant performance drops (up to relative error wrt competitors), reducing up to the training memory occupancy
Source: IIT TR-21/2020 and ISTI Technical Reports 2020/016, 2020, 2020
@techreport{oai:it.cnr:prodotti:439131, title = {Dynamic hard pruning of neural networks at the edge of the internet}, author = {Valerio L. and Nardini F. M. and Passarella A. and Perego R.}, doi = {10.32079/isti-tr-2020/016}, institution = {IIT TR-21/2020 and ISTI Technical Reports 2020/016, 2020, 2020}, year = {2020} }