Pith. sign in

REVIEW

Leveraging Structured Pruning of Convolutional Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.06247 v1 pith:4TQUCALW submitted 2022-06-13 cs.NE

classification cs.NE
keywords networkspruningconvolutionalneuralstructuredmethodprunedable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Structured pruning is a popular method to reduce the cost of convolutional neural networks, that are the state of the art in many computer vision tasks. However, depending on the architecture, pruning introduces dimensional discrepancies which prevent the actual reduction of pruned networks. To tackle this problem, we propose a method that is able to take any structured pruning mask and generate a network that does not encounter any of these problems and can be leveraged efficiently. We provide an accurate description of our solution and show results of gains, in energy consumption and inference time on embedded hardware, of pruned convolutional neural networks.

Discussion (0). Sign in to comment.

Pith tools