Pith. sign in

REVIEW

Deadwooding: Robust Global Pruning 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 2202.05226 v4 pith:BOPM4MYO submitted 2022-02-10 cs.LG

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

The ability of Deep Neural Networks to approximate highly complex functions is key to their success. This benefit, however, comes at the expense of a large model size, which challenges its deployment in resource-constrained environments. Pruning is an effective technique used to limit this issue, but often comes at the cost of reduced accuracy and adversarial robustness. This paper addresses these shortcomings and introduces Deadwooding, a novel global pruning technique that exploits a Lagrangian Dual method to encourage model sparsity while retaining accuracy and ensuring robustness. The resulting model is shown to significantly outperform the state-of-the-art studies in measures of robustness and accuracy.

Discussion (0). Continue with ORCID to comment.

Pith tools