Pith. sign in

REVIEW 2 cited by

Learned Threshold 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.00075 v2 pith:2AQ7DHLE submitted 2020-02-28 cs.LG stat.ML

classification cs.LGstat.ML
keywords networkspruningcompressionthresholdsaccuracyarchitecturesbatch-normalizationcomputationally
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

This paper presents a novel differentiable method for unstructured weight pruning of deep neural networks. Our learned-threshold pruning (LTP) method learns per-layer thresholds via gradient descent, unlike conventional methods where they are set as input. Making thresholds trainable also makes LTP computationally efficient, hence scalable to deeper networks. For example, it takes $30$ epochs for LTP to prune ResNet50 on ImageNet by a factor of $9.1$. This is in contrast to other methods that search for per-layer thresholds via a computationally intensive iterative pruning and fine-tuning process. Additionally, with a novel differentiable $L_0$ regularization, LTP is able to operate effectively on architectures with batch-normalization. This is important since $L_1$ and $L_2$ penalties lose their regularizing effect in networks with batch-normalization. Finally, LTP generates a trail of progressively sparser networks from which the desired pruned network can be picked based on sparsity and performance requirements. These features allow LTP to achieve competitive compression rates on ImageNet networks such as AlexNet ($26.4\times$ compression with $79.1\%$ Top-5 accuracy) and ResNet50 ($9.1\times$ compression with $92.0\%$ Top-5 accuracy). We also show that LTP effectively prunes modern \textit{compact} architectures, such as EfficientNet, MobileNetV2 and MixNet.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. A Predict-then-Correct Loop Based on Few-Shot Continuous Contextual Bandit for Demand Forecasting

    cs.LG 2026-07 conditional novelty 5.0 of 10

    A contextual-bandit correction layer with few-shot masked updates improves ML demand forecasts by 3.7–14.9% and cuts inventory costs in two retail datasets.

  2. UnIT: Scalable Unstructured Inference-Time Pruning for MAC-efficient Neural Inference on MCUs

    cs.LG 2025-07 conditional novelty 5.0 of 10

    UnIT enables unstructured, input-aware pruning of individual MACs on MCUs without retraining, reporting up to 82% MAC reduction and up to 84% energy savings at 0.48 to 7% accuracy loss.

Pith tools