Lookahead: A Far-sighted Alternative of Magnitude-based Pruning
Sejun Park, Jaeho Lee, Sangwoo Mo, Jinwoo Shin
摘要
Magnitude-based pruning is one of the simplest methods for pruning neural networks. Despite its simplicity, magnitude-based pruning and its variants demonstrated remarkable performances for pruning modern architectures. Based on the observation that the magnitude-based pruning indeed minimizes the Frobenius distortion of a linear operator corresponding to a single layer, we develop a simple pruning method, coined lookahead pruning, by extending the single layer optimization to a multi-layer optimization. Our experimental results demonstrate that the proposed method consistently outperforms the magnitude pruning on various networks including VGG and ResNet, particularly in the high-sparsity regime.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper20
- Pruning neural networks without any data by iteratively conserving synaptic flowHidenori Tanaka, Daniel Kunin, Daniel L. K. Yamins, Surya GanguliNeurIPS 2020 · 被引用 884 次
- Layer-adaptive Sparsity for the Magnitude-based PruningJaeho Lee, Sejun Park, Sangwoo Mo, Sungsoo Ahn 等ICLR 2021 · 被引用 331 次
- Structural Pruning for Diffusion ModelsGongfan Fang, Xinyin Ma, Xinchao WangNeurIPS 2023 · 被引用 257 次
- GDP: Stabilized Neural Network Pruning via Gates with Differentiable PolarizationYi Guo, Huan Yuan, Jianchao Tan, Zhangyang Wang 等ICCV 2021 · 被引用 52 次
- Addressing Loss of Plasticity and Catastrophic Forgetting in Continual LearningMohamed Elsayed, A. Rupam MahmoodICLR 2024 · 被引用 52 次
它引用的顶会 Paper1
相关 Paper
- Greedy Optimization Provably Wins the Lottery: Logarithmic Number of Winning Tickets is EnoughMao Ye, Lemeng Wu, Qiang LiuNeurIPS 2020 · 被引用 17 次
- Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep Neural NetworksKaixin Xu, Zhe Wang, Xue Geng, Min Wu 等ICCV 2023 · 被引用 24 次
- Layer-wise Model Pruning based on Mutual InformationChun Fan, Jiwei Li, Tianwei Zhang, Xiang Ao 等EMNLP 2021
- Movement Pruning: Adaptive Sparsity by Fine-TuningVictor Sanh, Thomas Wolf, Alexander M. RushNeurIPS 2020 · 被引用 656 次
- What Makes a Good Prune? Maximal Unstructured Pruning for Maximal Cosine SimilarityGabryel Mason-Williams, Fredrik DahlqvistICLR 2024 · 被引用 20 次
