SEVEN: Pruning Transformer Model by Reserving Sentinels
Not on the map. Why?
Abstract (arXiv)
Large-scale Transformer models (TM) have demonstrated outstanding performance across various tasks. However, their considerable parameter size restricts their applicability, particularly on mobile devices. Due to the dynamic and intricate nature of gradients on TM compared to Convolutional Neural Networks, commonly used pruning methods tend to retain weights with larger gradient noise. This results in pruned models that are sensitive to sparsity and datasets, exhibiting suboptimal performance. Symbolic Descent (SD) is a general approach for training and fine-tuning TM. In this paper, we attempt to describe the noisy batch gradient sequences on TM through the cumulative process of SD. We utilize this design to dynamically assess the importance scores of weights.SEVEN is introduced by us, which particularly favors weights with consistently high sensitivity, i.e., weights with small gradient noise. These weights are tended to be preserved by SEVEN. Extensive experiments on various TM in natural language, question-answering, and image classification domains are conducted to validate the effectiveness of SEVEN. The results demonstrate significant improvements of SEVEN in multiple pruning scenarios and across different sparsity levels. Additionally, SEVEN exhibits robust performance under various fine-tuning strategies. The code is publicly available at https://github.com/xiaojinying/SEVEN.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 42 of its 53 references that are in the map. First posted on arXiv 19 Mar 2024.
Builds on
42 of 53 references.
References · 42
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,219
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2019Are Sixteen Heads Really Better than One?cited by 803
30 more
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2020What is the State of Neural Network Pruning?cited by 578
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2022Using DeepSpeed and Megatron to Train Megatron-Turing NLG 530B, A Large-Scale Generative Language Modelcited by 557
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2023Symbolic Discovery of Optimization Algorithmscited by 423
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
- 2019Structured Pruning of Large Language Modelscited by 201
- 2021Fishr: Invariant Gradient Variances for Out-of-Distribution Generalizationcited by 186
- 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 184
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 158
- 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
- 2020When BERT Plays the Lottery, All Tickets Are Winningcited by 114
- 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
- 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 108
- 2020Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clippingcited by 104
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
- 2022GradViT: Gradient Inversion of Vision Transformerscited by 52
- 2021The effective noise of Stochastic Gradient Descentcited by 25
- 2023Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Modelscited by 20
- 2020Know What You Don't Need: Single-Shot Meta-Pruning for Attention Headscited by 16
- 2022Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Costcited by 11
- 2022The Topological BERT: Transforming Attention into Topology for Natural Language Processingcited by 10
Built on by
Not cited yet.