mlsanityData to 7 Oct 2026

The Need for Speed: Pruning Transformers with One Recipe

arXiv 2403.17921 ↗First posted 26 Mar 2024cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

We introduce the One-shot Pruning Technique for Interchangeable Networks (OPTIN) framework as a tool to increase the efficiency of pre-trained transformer architectures textitwithout requiring re-training. Recent works have explored improving transformer efficiency, however often incur computationally expensive re-training procedures or depend on architecture-specific characteristics, thus impeding practical wide-scale adoption. To address these shortcomings, the OPTIN framework leverages intermediate feature distillation, capturing the long-range dependencies of model parameters (coined textittrajectory), to produce state-of-the-art results on natural language, image classification, transfer learning, and semantic segmentation tasks textitwithout re-training. Given a FLOP constraint, the OPTIN framework will compress the network while maintaining competitive accuracy performance and improved throughput. Particularly, we show a ≤ 2% accuracy degradation from NLP baselines and a 0.5% improvement from state-of-the-art methods on image classification at competitive FLOPs reductions. We further demonstrate the generalization of tasks and architecture with comparative performance using Mask2Former for semantic segmentation and cnn-style networks. OPTIN presents one of the first one-shot efficient frameworks for compressing transformer architectures that generalizes well across different class domains, in particular: natural language and image-related tasks, without textitre-training.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 27 of its 60 references that are in the map. First posted on arXiv 26 Mar 2024.

Builds on

27 of 60 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  6. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  7. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
  8. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
  9. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  10. 2022Token Merging: Your ViT But Fastercited by 995
  11. 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
  12. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
15 more
  1. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  2. 2021I-BERT: Integer-only BERT Quantizationcited by 250
  3. 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
  4. 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
  5. 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
  6. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
  7. 2022Unified Visual Transformer Compressioncited by 79
  8. 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
  9. 2021Vision Transformer Pruningcited by 77
  10. 2021Learning Efficient Vision Transformers via Fine-Grained Manifold Distillationcited by 60
  11. 2023UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformerscited by 51
  12. 2022CP-ViT: Cascade Vision Transformer Pruning via Progressive Sparsity Predictioncited by 39
  13. 2020PoWER-BERT: Accelerating BERT Inference via Progressive Word-vector Eliminationcited by 10
  14. 2023End-to-End Supervised Multilabel Contrastive Learningcited by 8
  15. 2024ProbMCL: Simple Probabilistic Contrastive Learning for Multi-label Visual Classificationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 8; 2026: 2.

15 papers.

Sort:

By area: