Pith. sign in

REVIEW 2 cited by

What is the State of Neural Network Pruning?

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 2003.03033 v1 pith:5BKCXYUU submitted 2020-03-06 cs.LG stat.ML

classification cs.LGstat.ML
keywords pruningnetworkcompareliteraturemethodsneuralshrinkbenchstandardized
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural network pruning---the task of reducing the size of a network by removing parameters---has been the subject of a great deal of work in recent years. We provide a meta-analysis of the literature, including an overview of approaches to pruning and consistent findings in the literature. After aggregating results across 81 papers and pruning hundreds of models in controlled conditions, our clearest finding is that the community suffers from a lack of standardized benchmarks and metrics. This deficiency is substantial enough that it is hard to compare pruning techniques to one another or determine how much progress the field has made over the past three decades. To address this situation, we identify issues with current practices, suggest concrete remedies, and introduce ShrinkBench, an open-source framework to facilitate standardized evaluations of pruning methods. We use ShrinkBench to compare various pruning techniques and show that its comprehensive evaluation can prevent common pitfalls when comparing pruning methods.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuits

    quant-ph 2025-09 conditional novelty 5.0 of 10

    On toy classification tasks, variational quantum circuits show weak lottery ticket behavior: pruned circuits retain full accuracy with roughly 26% to 51% of their parameters, while strong-ticket evidence is limited to...

  2. Recurrent Deep Differentiable Logic Gate Networks

    cs.LG 2025-08 conditional novelty 5.0 of 10

    A recurrent version of differentiable logic gate networks nearly matches a GRU on a truncated WMT14 English-German task, as a proof of concept.

Pith tools