Efficient Similarity-based Passive Filter Pruning for Compressing CNNs
Arshdeep Singh, Mark D. Plumbley

TL;DR
This paper introduces an efficient similarity-based passive filter pruning method for CNNs that approximates the pairwise filter similarity matrix using Nyström method, significantly reducing computation while maintaining accuracy.
Contribution
It proposes a novel Nyström approximation approach to speed up similarity-based filter pruning in CNNs, achieving comparable or better results than existing methods.
Findings
3 times faster than traditional similarity-based pruning
Maintains same accuracy with reduced computation
Performs better or equal to norm-based pruning methods
Abstract
Convolution neural networks (CNNs) have shown great success in various applications. However, the computational complexity and memory storage of CNNs is a bottleneck for their deployment on resource-constrained devices. Recent efforts towards reducing the computation cost and the memory overhead of CNNs involve similarity-based passive filter pruning methods. Similarity-based passive filter pruning methods compute a pairwise similarity matrix for the filters and eliminate a few similar filters to obtain a small pruned CNN. However, the computational complexity of computing the pairwise similarity matrix is high, particularly when a convolutional layer has many filters. To reduce the computational complexity in obtaining the pairwise similarity matrix, we propose to use an efficient method where the complete pairwise similarity matrix is approximated from only a few of its columns by…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpeech and Audio Processing · Music and Audio Processing · Speech Recognition and Synthesis
MethodsPruning
