Pruning Redundant Mappings in Transformer Models via Spectral-Normalized Identity Prior
Not on the map. Why?
Abstract (arXiv)
Traditional (unstructured) pruning methods for a Transformer model focus on regularizing the individual weights by penalizing them toward zero. In this work, we explore spectral-normalized identity priors (SNIP), a structured pruning approach that penalizes an entire residual module in a Transformer model toward an identity mapping. Our method identifies and discards unimportant non-linear mappings in the residual connections by applying a thresholding operator on the function norm. It is applicable to any structured module, including a single attention head, an entire attention block, or a feed-forward subnetwork. Furthermore, we introduce spectral normalization to stabilize the distribution of the post-activation values of the Transformer layers, further improving the pruning effectiveness of the proposed methodology. We conduct experiments with BERT on 5 GLUE benchmark tasks to demonstrate that SNIP achieves effective pruning results while maintaining comparable performance. Specifically, we improve the performance over the state-of-the-art by 0.5 to 1.0% on average at 50% compression ratio.
Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 12; 2024: 3; 2025: 2.
23 papers.
Sort:
By area:
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2021Learned Token Pruning for Transformerscited by 138
- 2022Vision Transformer Slimming: Multi-Dimension Searching in Continuous Optimization Spacecited by 66
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2022A Survey on Model Compression and Acceleration for Pretrained Language Modelscited by 45
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2023Adapting a Language Model While Preserving its General Knowledgecited by 23
- 2021From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compressioncited by 18
- 2024A Comprehensive Survey of Compression Algorithms for Language Modelscited by 15
- 2023HighLight: Efficient and Flexible DNN Acceleration with Hierarchical Structured Sparsitycited by 12
- 2023Accurate Retraining-free Pruning for Pretrained Encoder-based Language Modelscited by 11
- 2023Towards Learning Discrete Representations via Self-Supervision for Wearables-Based Human Activity Recognitioncited by 7
11 more
- 2023Sub-network Discovery and Soft-masking for Continual Learning of Mixed Taskscited by 7
- 2023rm SP3: Enhancing Structured Pruning via PCA Projectioncited by 5
- 2022Fine- and Coarse-Granularity Hybrid Self-Attention for Efficient BERTcited by 4
- 2023Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selectioncited by 3
- 2023An Empirical Study on the Transferability of Transformer Modules in Parameter-Efficient Fine-Tuningcited by 2
- 2024STAT: Shrinking Transformers After Trainingcited by 2
- 2025Fairness Evaluation and Inference Level Mitigation in LLMscited by 2
- 2023Learning a Consensus Sub-Network with Polarization Regularization and One Pass Trainingcited by 1
- 2023End-to-End Neural Network Compression via fracℓ1ℓ2 Regularized Latency Surrogatescited by 1
- 2023Pit One Against Many: Leveraging Attention-head Embeddings for Parameter-efficient Multi-head Attentioncited by 1
- 2025Leveraging Label Potential for Enhanced Multimodal Emotion Recognitioncited by 0
- 2025Fairness Evaluation and Inference Level Mitigation in LLMs21 Oct 2025
- 2025Leveraging Label Potential for Enhanced Multimodal Emotion Recognition7 Apr 2025
- 2024STAT: Shrinking Transformers After Training29 May 2024
- 2024Model Compression and Efficient Inference for Large Language Models: A Survey15 Feb 2024
- 2024A Comprehensive Survey of Compression Algorithms for Language Models27 Jan 2024
- 2023Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selection19 Oct 2023
- 2023Sub-network Discovery and Soft-masking for Continual Learning of Mixed Tasks13 Oct 2023
- 2023Pit One Against Many: Leveraging Attention-head Embeddings for Parameter-efficient Multi-head Attention11 Oct 2023
- 2023rm SP3: Enhancing Structured Pruning via PCA Projection31 Aug 2023
- 2023Accurate Retraining-free Pruning for Pretrained Encoder-based Language Models7 Aug 2023
- 2023End-to-End Neural Network Compression via fracℓ1ℓ2 Regularized Latency Surrogates9 Jun 2023
- 2023Towards Learning Discrete Representations via Self-Supervision for Wearables-Based Human Activity Recognition1 Jun 2023
11 more
- 2023HighLight: Efficient and Flexible DNN Acceleration with Hierarchical Structured Sparsity22 May 2023
- 2023Gradient-Free Structured Pruning with Unlabeled Data7 Mar 2023
- 2023Learning a Consensus Sub-Network with Polarization Regularization and One Pass Training17 Feb 2023
- 2023An Empirical Study on the Transferability of Transformer Modules in Parameter-Efficient Fine-Tuning1 Feb 2023
- 2023Adapting a Language Model While Preserving its General Knowledge21 Jan 2023
- 2022A Fast Post-Training Pruning Framework for Transformers29 Mar 2022
- 2022Fine- and Coarse-Granularity Hybrid Self-Attention for Efficient BERT17 Mar 2022
- 2022A Survey on Model Compression and Acceleration for Pretrained Language Models15 Feb 2022
- 2022Vision Transformer Slimming: Multi-Dimension Searching in Continuous Optimization Space3 Jan 2022
- 2021From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compression14 Dec 2021
- 2021Learned Token Pruning for Transformers2 Jul 2021
- 2021Learned Token Pruning for Transformerscited by 138
- 2021Learned Token Pruning for Transformers2 Jul 2021
- 2025Fairness Evaluation and Inference Level Mitigation in LLMs21 Oct 2025
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2022Vision Transformer Slimming: Multi-Dimension Searching in Continuous Optimization Spacecited by 66
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2022A Survey on Model Compression and Acceleration for Pretrained Language Modelscited by 45
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2023Adapting a Language Model While Preserving its General Knowledgecited by 23
- 2021From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compressioncited by 18
- 2024A Comprehensive Survey of Compression Algorithms for Language Modelscited by 15
- 2023HighLight: Efficient and Flexible DNN Acceleration with Hierarchical Structured Sparsitycited by 12
- 2023Accurate Retraining-free Pruning for Pretrained Encoder-based Language Modelscited by 11
- 2023Towards Learning Discrete Representations via Self-Supervision for Wearables-Based Human Activity Recognitioncited by 7
- 2023Sub-network Discovery and Soft-masking for Continual Learning of Mixed Taskscited by 7
12 most cited of 21 All 21 (JSON)
- 2025Leveraging Label Potential for Enhanced Multimodal Emotion Recognition7 Apr 2025
- 2024STAT: Shrinking Transformers After Training29 May 2024
- 2024Model Compression and Efficient Inference for Large Language Models: A Survey15 Feb 2024
- 2024A Comprehensive Survey of Compression Algorithms for Language Models27 Jan 2024
- 2023Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selection19 Oct 2023
- 2023Sub-network Discovery and Soft-masking for Continual Learning of Mixed Tasks13 Oct 2023
- 2023Pit One Against Many: Leveraging Attention-head Embeddings for Parameter-efficient Multi-head Attention11 Oct 2023
- 2023rm SP3: Enhancing Structured Pruning via PCA Projection31 Aug 2023
- 2023Accurate Retraining-free Pruning for Pretrained Encoder-based Language Models7 Aug 2023
- 2023End-to-End Neural Network Compression via fracℓ1ℓ2 Regularized Latency Surrogates9 Jun 2023
- 2023Towards Learning Discrete Representations via Self-Supervision for Wearables-Based Human Activity Recognition1 Jun 2023
- 2023HighLight: Efficient and Flexible DNN Acceleration with Hierarchical Structured Sparsity22 May 2023
12 newest of 21 All 21 (JSON)