Lune

ICLR2025顶会

Optimal Brain Apoptosis

Mingyuan Sun, Zheng Fang, Jiaxu Wang, Junjie Jiang, Delei Kong, Chenming Hu, Yuetong Fang, Renjing Xu

问 Lune

摘要

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 .

问 Lune

尽管问,回答会引用原文。

Lune 会读完全文和相关的 Paper,每个回答都附上所依据的原文段落。

可以从这些问题问起

Lune 的依据

全文 · 引用它的 1 篇顶会 Paper · 相关的 Paper

获取答案

免费开始,无需绑卡

引用它的顶会 Paper1

  1. Ensembling Pruned Attention Heads For Uncertainty-Aware Efficient TransformersFiras Gabetni, Giuseppe Curci, Andrea Pilzer, Subhankar Roy 等ICLR 2026 · 5 次引用

它引用的 Paper11

  1. An Image is Worth 16x16 Words: Transformers for Image Recognition at ScaleAlexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn 等ICLR 2021 · 21,477 次引用
  2. Group Fisher Pruning for Practical Network CompressionLiyang Liu, Shilong Zhang, Zhanghui Kuang, Aojun Zhou 等ICML 2021 · 204 次引用
  3. Aligned Structured Sparsity Learning for Efficient Image Super-ResolutionYulun Zhang, Huan Wang, Can Qin, Yun FuNeurIPS 2021 · 72 次引用
  4. Distilling Holistic Knowledge with Graph Neural NetworksSheng Zhou, Yucheng Wang, Defang Chen, Jiawei Chen 等ICCV 2021 · 69 次引用
  5. The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural NetworksXin Yu, Thiago Serra, Srikumar Ramalingam, Shandian ZheICML 2022 · 60 次引用

相关 Paper

  1. WoodFisher: Efficient Second-Order Approximation for Neural Network CompressionSidak Pal Singh, Dan AlistarhNeurIPS 2020 · 217 次引用
  2. SOSP: Efficiently Capturing Global Correlations by Second-Order Structured PruningManuel Nonnenmacher, Thomas Pfeil, Ingo Steinwart, David ReebICLR 2022 · 48 次引用
  3. IDAP++: Advancing Divergence-Aware Pruning with Joint Filter and Layer OptimizationAleksei Samarin, Artem A. Nazarenko, Egor Kotenko, Alexander Savelev 等SIGMOD 2026
  4. Numerical Optimizations for Weighted Low-rank Estimation on Language ModelsTing Hua, Yen-Chang Hsu, Felicity Wang, Qian Lou 等EMNLP 2022 · 7 次引用
  5. Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck PrincipleSong Guo, Lei Zhang, Xiawu Zheng, Yan Wang 等ICCV 2023 · 30 次引用
黄昏的海面,两侧是细线勾勒的悬崖