Pith. sign in

REVIEW 3 cited by

Data-Driven Sparse Structure Selection for 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 1707.01213 v3 pith:MCQJJ6X7 submitted 2017-07-05 cs.CV cs.LGcs.NE

classification cs.CVcs.LGcs.NE
keywords selectiondeepmethodstructureeffectiveend-to-endfactorsframework
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deep convolutional neural networks have liberated its extraordinary power on various tasks. However, it is still very challenging to deploy state-of-the-art models into real-world applications due to their high computational complexity. How can we design a compact and effective network without massive experiments and expert knowledge? In this paper, we propose a simple and effective framework to learn and prune deep models in an end-to-end manner. In our framework, a new type of parameter -- scaling factor is first introduced to scale the outputs of specific structures, such as neurons, groups or residual blocks. Then we add sparsity regularizations on these factors, and solve this optimization problem by a modified stochastic Accelerated Proximal Gradient (APG) method. By forcing some of the factors to zero, we can safely remove the corresponding structures, thus prune the unimportant parts of a CNN. Comparing with other structure selection methods that may need thousands of trials or iterative fine-tuning, our method is trained fully end-to-end in one training pass without bells and whistles. We evaluate our method, Sparse Structure Selection with several state-of-the-art CNNs, and demonstrate very promising results with adaptive depth and width selection.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Importance Estimation for Neural Network Pruning

    cs.LG 2019-06 unverdicted novelty 7.0 of 10

    Taylor-expansion importance scoring enables layer-agnostic pruning of neural networks that outperforms prior methods on ImageNet accuracy-FLOPs trade-offs.

  2. CoNNect: Connectivity-Based Regularization for Structural Pruning

    cs.LG 2025-02 conditional novelty 6.0 of 10

    CoNNect is a differentiable connectivity regularizer that encourages sparse but connected networks, improving structural pruning accuracy when added to DepGraph and LLM-pruner.

  3. Group Pruning using a Bounded-Lp norm for Group Gating and Regularization

    stat.ML 2019-08 conditional novelty 4.0 of 10

    A bounded-L1 regularizer combined with exponential gating layers prunes neural network channels to exactly zero during training, compressing standard models by 30 to 75 percent with little accuracy loss.

Pith tools