TL;DR
This paper introduces a systematic DNN weight pruning framework using ADMM, providing guarantees on sparsity, convergence, and outperforming prior heuristic methods in reducing model size and computation without accuracy loss.
Contribution
The paper formulates DNN weight pruning as a nonconvex optimization problem and applies ADMM for systematic, guaranteed, and efficient pruning, outperforming prior heuristic approaches.
Findings
Achieves 71.2x weight reduction on LeNet-5 without accuracy loss.
Achieves 21x weight reduction on AlexNet without accuracy loss.
Reduces total computation by five times in convolutional layers.
Abstract
Weight pruning methods for deep neural networks (DNNs) have been investigated recently, but prior work in this area is mainly heuristic, iterative pruning, thereby lacking guarantees on the weight reduction ratio and convergence time. To mitigate these limitations, we present a systematic weight pruning framework of DNNs using the alternating direction method of multipliers (ADMM). We first formulate the weight pruning problem of DNNs as a nonconvex optimization problem with combinatorial constraints specifying the sparsity requirements, and then adopt the ADMM framework for systematic weight pruning. By using ADMM, the original nonconvex optimization problem is decomposed into two subproblems that are solved iteratively. One of these subproblems can be solved using stochastic gradient descent, the other can be solved analytically. Besides, our method achieves a fast convergence rate.…
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
MethodsPruning · 1x1 Convolution · Convolution · Local Response Normalization · Grouped Convolution · *Communicated@Fast*How Do I Communicate to Expedia? · Dropout · Dense Connections · Max Pooling · Softmax
