Pith. sign in

REVIEW 4 cited by

Learning Structured Sparsity in Deep 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 1608.03665 v4 pith:ME7AYKEZ submitted 2016-08-12 cs.NE cs.LGstat.ML

classification cs.NEcs.LGstat.ML
keywords sparsitycomputationdeeplayerlayersspeedupsstructurestructured
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

High demand for computation resources severely hinders deployment of large-scale Deep Neural Networks (DNN) in resource constrained devices. In this work, we propose a Structured Sparsity Learning (SSL) method to regularize the structures (i.e., filters, channels, filter shapes, and layer depth) of DNNs. SSL can: (1) learn a compact structure from a bigger DNN to reduce computation cost; (2) obtain a hardware-friendly structured sparsity of DNN to efficiently accelerate the DNNs evaluation. Experimental results show that SSL achieves on average 5.1x and 3.1x speedups of convolutional layer computation of AlexNet against CPU and GPU, respectively, with off-the-shelf libraries. These speedups are about twice speedups of non-structured sparsity; (3) regularize the DNN structure to improve classification accuracy. The results show that for CIFAR-10, regularization on layer depth can reduce 20 layers of a Deep Residual Network (ResNet) to 18 layers while improve the accuracy from 91.25% to 92.60%, which is still slightly higher than that of original ResNet with 32 layers. For AlexNet, structure regularization by SSL also reduces the error by around ~1%. Open source code is in https://github.com/wenwei202/caffe/tree/scnn

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TabNet: Attentive Interpretable Tabular Learning

    cs.LG 2019-08 conditional novelty 6.0 of 10

    TabNet uses sequential attention with sparsemax masks for instance-wise feature selection and reports state-of-the-art results on several tabular classification and regression benchmarks, plus a masked-reconstruction ...

  2. Architecture-aware Network Pruning for Vision Quality Applications

    eess.IV 2019-08 conditional novelty 5.0 of 10

    An architecture-aware pruning method cuts SID and EDSR network MACs by 58% and 37% with no measured PSNR or SSIM drop.

  3. Towards Adaptive Deep Learning: Model Elasticity via Prune-and-Grow CNN Architectures

    cs.LG 2025-05 reject novelty 3.0 of 10

    A master's thesis that prunes CNNs into smaller subnetworks and then rebuilds them by reinserting pruned filters, but it does not test the claimed runtime adaptivity.

  4. On Accelerating Edge AI: Optimizing Resource-Constrained Environments

    cs.LG 2025-01 conditional novelty 2.0 of 10

    The paper argues that model compression, neural architecture search, and compiler optimizations work together to accelerate edge AI, but it provides no new experimental evidence.

Pith tools