Pith. sign in

REVIEW 2 cited by

A Gradient Flow Framework For Analyzing 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 2009.11839 v4 pith:YZ7UA4DZ submitted 2020-09-24 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords pruningmodelsmeasuresmodelearly-onevolutionframeworkgradient
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recent network pruning methods focus on pruning models early-on in training. To estimate the impact of removing a parameter, these methods use importance measures that were originally designed to prune trained models. Despite lacking justification for their use early-on in training, such measures result in surprisingly low accuracy loss. To better explain this behavior, we develop a general framework that uses gradient flow to unify state-of-the-art importance measures through the norm of model parameters. We use this framework to determine the relationship between pruning measures and evolution of model parameters, establishing several results related to pruning models early-on in training: (i) magnitude-based pruning removes parameters that contribute least to reduction in loss, resulting in models that converge faster than magnitude-agnostic methods; (ii) loss-preservation based pruning preserves first-order model evolution dynamics and is therefore appropriate for pruning minimally trained models; and (iii) gradient-norm based pruning affects second-order model evolution dynamics, such that increasing gradient norm via pruning can produce poorly performing models. We validate our claims on several VGG-13, MobileNet-V1, and ResNet-56 models trained on CIFAR-10/CIFAR-100. Code available at https://github.com/EkdeepSLubana/flowandprune.

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. Beyond Task Vectors: Selective Task Arithmetic Based on Importance Metrics

    cs.LG 2024-11 reject novelty 5.0 of 10

    STA improves task arithmetic by masking task vectors with a first-order Taylor expansion importance metric, raising average fused accuracy to 82.84% on six vision tasks.

  2. Pruning for Sparse Diffusion Models based on Gradient Flow

    cs.LG 2025-01 conditional novelty 3.0 of 10

    Progressive soft pruning with the GraSP gradient-flow criterion gives small FID improvements over one-shot pruning on DDPMs at 50% sparsity.

Pith tools