Pith. sign in

REVIEW 3 cited by

Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeon

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 1705.07565 v2 pith:5MXV2K7S submitted 2017-05-22 cs.NE cs.CVcs.LG

classification cs.NEcs.CVcs.LG
keywords deeplayer-wisemethodnetworknetworksneuralperformanceprediction
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

How to develop slim and accurate deep neural networks has become crucial for real- world applications, especially for those employed in embedded systems. Though previous work along this research line has shown some promising results, most existing methods either fail to significantly compress a well-trained deep network or require a heavy retraining process for the pruned deep network to re-boost its prediction performance. In this paper, we propose a new layer-wise pruning method for deep neural networks. In our proposed method, parameters of each individual layer are pruned independently based on second order derivatives of a layer-wise error function with respect to the corresponding parameters. We prove that the final prediction performance drop after pruning is bounded by a linear combination of the reconstructed errors caused at each layer. Therefore, there is a guarantee that one only needs to perform a light retraining process on the pruned network to resume its original prediction performance. We conduct extensive experiments on benchmark datasets to demonstrate the effectiveness of our pruning method compared with several state-of-the-art baseline methods.

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. Efficient Column-Wise N:M Pruning on RISC-V CPU

    cs.DC 2025-07 conditional novelty 6.0 of 10

    Column-wise N:M pruning plus fused im2col and data packing accelerates ResNet inference on RISC-V vector CPUs by up to 4x while keeping ImageNet top-1 accuracy within 2.1% of the dense model.

  2. Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study

    cs.CL 2025-07 conditional novelty 5.0 of 10

    Structural pruning with finetuning plus hidden-state distillation recovers most performance in multimodal LLMs, with 5% of training data sufficient at moderate compression levels.

  3. Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity

    cs.LG 2025-06 conditional novelty 4.0 of 10

    Applying single-shot SNIP pruning with dataset-size-dependent sparsity reduces overfitting and improves episodic return of offline RL algorithms on 5k to 100k sample D4RL continuous control tasks.

Pith tools