Optimal Brain Apoptosis
Mingyuan Sun, Zheng Fang, Jiaxu Wang, Junjie Jiang, Delei Kong, Chenming Hu, Yuetong Fang, Renjing Xu
Abstract
The increasing complexity and parameter count of Convolutional Neural Networks (CNNs) and Transformers pose challenges in terms of computational efficiency and resource demands. Pruning has been identified as an effective strategy to address these challenges by removing redundant elements such as neurons, channels, or connections, thereby enhancing computational efficiency without heavily compromising performance. This paper builds on the foundational work of Optimal Brain Damage (OBD) by advancing the methodology of parameter importance estimation using the Hessian matrix. Unlike previous approaches that rely on approximations, we introduce Optimal Brain Apoptosis (OBA), a novel pruning method that calculates the Hessian-vector product value directly for each parameter. By decomposing the Hessian matrix across network layers and identifying conditions under which inter-layer Hessian submatrices are non-zero, we propose a highly efficient technique for computing the secondorder Taylor expansion of parameters. This approach allows for a more precise pruning process, particularly in the context of CNNs and Transformers, as validated in our experiments including VGG19, ResNet32, ResNet50, and ViT-B/16 on CIFAR10, CIFAR100 and Imagenet datasets. Our code is available at https://github.com/NEU-REAL/OBA .
Ask Lune
Ask anything. The answer quotes the paper.
Lune reads all of it and the papers around it, then shows you the passages behind every answer.
Lune answers from
the full paper · 1 top-tier paper that cites it · related work
Free to start. No credit card required.
Cited by top-tier papers1
Builds on11
- An Image is Worth 16x16 Words: Transformers for Image Recognition at ScaleAlexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn et al.ICLR 2021 · 21,477 citations
- Group Fisher Pruning for Practical Network CompressionLiyang Liu, Shilong Zhang, Zhanghui Kuang, Aojun Zhou et al.ICML 2021 · 204 citations
- Aligned Structured Sparsity Learning for Efficient Image Super-ResolutionYulun Zhang, Huan Wang, Can Qin, Yun FuNeurIPS 2021 · 72 citations
- Distilling Holistic Knowledge with Graph Neural NetworksSheng Zhou, Yucheng Wang, Defang Chen, Jiawei Chen et al.ICCV 2021 · 69 citations
- The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural NetworksXin Yu, Thiago Serra, Srikumar Ramalingam, Shandian ZheICML 2022 · 60 citations
Related papers
- WoodFisher: Efficient Second-Order Approximation for Neural Network CompressionSidak Pal Singh, Dan AlistarhNeurIPS 2020 · 217 citations
- SOSP: Efficiently Capturing Global Correlations by Second-Order Structured PruningManuel Nonnenmacher, Thomas Pfeil, Ingo Steinwart, David ReebICLR 2022 · 48 citations
- IDAP++: Advancing Divergence-Aware Pruning with Joint Filter and Layer OptimizationAleksei Samarin, Artem A. Nazarenko, Egor Kotenko, Alexander Savelev et al.SIGMOD 2026
- Numerical Optimizations for Weighted Low-rank Estimation on Language ModelsTing Hua, Yen-Chang Hsu, Felicity Wang, Qian Lou et al.EMNLP 2022 · 7 citations
- Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck PrincipleSong Guo, Lei Zhang, Xiawu Zheng, Yan Wang et al.ICCV 2023 · 30 citations
