A Gradient Flow Framework For Analyzing Network Pruning
Ekdeep Singh Lubana, Robert P. Dick
摘要
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. 1 gradient flow refers to gradient descent with infinitesimal learning rate; see Equation 6 for a short primer.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper21
- Mechanistically analyzing the effects of fine-tuning on procedurally defined tasksSamyak Jain, Robert Kirk, Ekdeep Singh Lubana, Robert P. Dick 等ICLR 2024 · 被引用 108 次
- Gradient Flow in Sparse Neural Networks and How Lottery Tickets WinUtku Evci, Yani Ioannou, Cem Keskin, Yann N. DauphinAAAI 2022 · 被引用 106 次
- GDP: Stabilized Neural Network Pruning via Gates with Differentiable PolarizationYi Guo, Huan Yuan, Jianchao Tan, Zhangyang Wang 等ICCV 2021 · 被引用 52 次
- Validating the Lottery Ticket Hypothesis with Inertial Manifold TheoryZeru Zhang, Jiayin Jin, Zijie Zhang, Yang Zhou 等NeurIPS 2021 · 被引用 45 次
- Learn more, but bother less: parameter efficient continual learningFuli Qiao, Mehrdad MahdaviNeurIPS 2024 · 被引用 36 次
它引用的顶会 Paper5
- Picking Winning Tickets Before Training by Preserving Gradient FlowChaoqi Wang, Guodong Zhang, Roger B. GrosseICLR 2020 · 被引用 743 次
- Proving the Lottery Ticket Hypothesis: Pruning is All You NeedEran Malach, Gilad Yehudai, Shai Shalev-Shwartz, Ohad ShamirICML 2020 · 被引用 327 次
- A Signal Propagation Perspective for Pruning Neural Networks at InitializationNamhoon Lee, Thalaiyasingam Ajanthan, Stephen Gould, Philip H. S. TorrICLR 2020 · 被引用 174 次
- Good Subnetworks Provably Exist: Pruning via Greedy Forward SelectionMao Ye, Chengyue Gong, Lizhen Nie, Denny Zhou 等ICML 2020 · 被引用 123 次
- Fast Sparse ConvNetsErich Elsen, Marat Dukhan, Trevor Gale, Karen SimonyanCVPR 2020
相关 Paper
- Prior Gradient Mask Guided Pruning-Aware Fine-TuningLinhang Cai, Zhulin An, Chuanguang Yang, Yangchun Yan 等AAAI 2022 · 被引用 44 次
- Entropy Induced Pruning Framework for Convolutional Neural NetworksYiheng Lu, Ziyu Guan, Yaming Yang, Wei Zhao 等AAAI 2024 · 被引用 9 次
- Pruning neural networks without any data by iteratively conserving synaptic flowHidenori Tanaka, Daniel Kunin, Daniel L. K. Yamins, Surya GanguliNeurIPS 2020 · 被引用 884 次
- When to Prune? A Policy towards Early Structural PruningMaying Shen, Pavlo Molchanov, Hongxu Yin, José M. ÁlvarezCVPR 2022 · 被引用 46 次
- Pruning from ScratchYulong Wang, Xiaolu Zhang, Lingxi Xie, Jun Zhou 等AAAI 2020 · 被引用 219 次
