Pith. sign in

REVIEW 1 cited by

How Not to Give a FLOP: Combining Regularization and Pruning for Efficient Inference

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.13593 v2 pith:MJV2DV5K submitted 2020-03-30 cs.LG cs.CVeess.IVstat.ML

classification cs.LGcs.CVeess.IVstat.ML
keywords pruningregularizationdeepefficientinferenceapplyarchitecturebeen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The challenge of speeding up deep learning models during the deployment phase has been a large, expensive bottleneck in the modern tech industry. In this paper, we examine the use of both regularization and pruning for reduced computational complexity and more efficient inference in Deep Neural Networks (DNNs). In particular, we apply mixup and cutout regularizations and soft filter pruning to the ResNet architecture, focusing on minimizing floating-point operations (FLOPs). Furthermore, by using regularization in conjunction with network pruning, we show that such a combination makes a substantial improvement over each of the two techniques individually.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Amplifying Emotional Signals: Data-Efficient Deep Learning for Robust Speech Emotion Recognition

    eess.AS 2025-08 reject novelty 3.0 of 10

    A pretrained ResNet34 with augmentation reaches 66.7% accuracy on a combined RAVDESS/SAVEE emotion set, but only on a validation split, so the claimed new benchmark is unverified.

Pith tools