Pith. sign in

REVIEW 1 cited by

Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedure

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 2406.03879 v2 pith:BERQ3YEK submitted 2024-06-06 cs.LG cs.CV

classification cs.LGcs.CV
keywords pruningmethodssmoothself-rectifyingapproachdecayfurtherinformation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Current structured pruning methods often result in considerable accuracy drops due to abrupt network changes and loss of information from pruned structures. To address these issues, we introduce the Decay Pruning Method (DPM), a novel smooth pruning approach with a self-rectifying mechanism. DPM consists of two key components: (i) Smooth Pruning: It converts conventional single-step pruning into multi-step smooth pruning, gradually reducing redundant structures to zero over N steps with ongoing optimization. (ii) Self-Rectifying: This procedure further enhances the aforementioned process by rectifying sub-optimal pruning based on gradient information. Our approach demonstrates strong generalizability and can be easily integrated with various existing pruning methods. We validate the effectiveness of DPM by integrating it with three popular pruning methods: OTOv2, Depgraph, and Gate Decorator. Experimental results show consistent improvements in performance compared to the original pruning methods, along with further reductions of FLOPs in most scenarios.

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. Enhanced Pruning Strategy for Multi-Component Neural Architectures Using Component-Aware Graph Analysis

    cs.LG 2025-04 conditional novelty 5.0 of 10

    Component-aware dependency graphs that isolate modules and inter-module flows produce finer pruning groups and gentler performance loss on a TD-MPC control task than vanilla dependency-graph pruning.

Pith tools