mlsanityData to 14 Oct 2026

PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance

arXiv 2206.12562 ↗First posted 25 Jun 2022cs.LGcited by 79

Not on the map. Why?

Abstract (arXiv)

Large Transformer-based models have exhibited superior performance in various natural language processing and computer vision tasks. However, these models contain enormous amounts of parameters, which restrict their deployment to real-world applications. To reduce the model size, researchers prune these models based on the weights' importance scores. However, such scores are usually estimated on mini-batches during training, which incurs large variability/uncertainty due to mini-batch sampling and complicated training dynamics. As a result, some crucial weights could be pruned by commonly used pruning methods because of such uncertainty, which makes training unstable and hurts generalization. To resolve this issue, we propose PLATON, which captures the uncertainty of importance scores by upper confidence bound (UCB) of importance estimation. In particular, for the weights with low importance scores but high uncertainty, PLATON tends to retain them and explores their capacity. We conduct extensive experiments with several Transformer-based models on natural language understanding, question answering and image classification to validate the effectiveness of PLATON. Results demonstrate that PLATON manifests notable improvement under different sparsity levels. Our code is publicly available at https://github.com/QingruZhang/PLATON.

Key facts. Cited by 79 papers in the map (data through 14 Oct 2026). Builds on 33 of its 61 references that are in the map. First posted on arXiv 25 Jun 2022.

Builds on

33 of 61 references.

References · 33

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  7. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  8. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  9. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  10. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  11. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  12. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
21 more
  1. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
  2. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 1,001
  3. 2018Neural Network Acceptability Judgmentscited by 958
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  5. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
  6. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  7. 2019Importance Estimation for Neural Network Pruningcited by 541
  8. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
  9. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  10. 2019Multi-Task Deep Neural Networks for Natural Language Understandingcited by 350
  11. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 295
  12. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  13. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
  14. 2021Block Pruning For Faster Transformerscited by 177
  15. 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
  16. 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
  17. 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
  18. 2020The Microsoft Toolkit of Multi-Task Deep Neural Networks for Natural Language Understandingcited by 28
  19. 2021A Biased Graph Neural Network Sampler with Near-Optimal Regretcited by 17
  20. 2020On Iterative Neural Network Pruning, Reinitialization, and the Similarity of Maskscited by 13
  21. 2018Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weightscited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 28; 2024: 28; 2025: 14; 2026: 7.

79 papers.

Sort:

By area:

  1. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  2. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  3. 2024A Survey on Efficient Inference for Large Language Modelscited by 205
  4. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  5. 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
  6. 2022Rethinking Vision Transformers for MobileNet Size and Speedcited by 121
  7. 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 108
  8. 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 104
  9. 2024A Survey of Resource-efficient LLM and Multimodal Foundation Modelscited by 86
  10. 2023X-Pruner: eXplainable Pruning for Vision Transformerscited by 68
  11. 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 64
  12. 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 62
38 more
  1. 2023Self-Supervised Multimodal Learning: A Surveycited by 58
  2. 2023LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuningcited by 53
  3. 2024Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmeticcited by 50
  4. 2024Automated Federated Pipeline for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 49
  5. 2023IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuningcited by 45
  6. 2024ExeGPT: Constraint-Aware Resource Scheduling for LLM Inferencecited by 45
  7. 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
  8. 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
  9. 2023Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracycited by 37
  10. 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
  11. 2023Structured Pruning of Self-Supervised Pre-trained Models for Speech Recognition and Understandingcited by 31
  12. 2023What Matters In The Structured Pruning of Generative Language Models?cited by 30
  13. 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27
  14. 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
  15. 2023HomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformerscited by 25
  16. 2024Unveiling Linguistic Regions in Large Language Modelscited by 22
  17. 2024RoseLoRA: Row and Column-wise Sparse Low-rank Adaptation of Pre-trained Language Model for Knowledge Editing and Fine-tuningcited by 21
  18. 2023ECoFLaP: Efficient Coarse-to-Fine Layer-Wise Pruning for Vision-Language Modelscited by 19
  19. 2024TaSL: Continual Dialog State Tracking via Task Skill Localization and Consolidationcited by 18
  20. 2024The Need for Speed: Pruning Transformers with One Recipecited by 16
  21. 2025Recurrent Knowledge Identification and Fusion for Language Model Continual Learningcited by 15
  22. 2024Parenting: Optimizing Knowledge Selection of Retrieval-Augmented Language Models with Parameter Decoupling and Tailored Tuningcited by 14
  23. 2023VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Corescited by 13
  24. 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMscited by 13
  25. 2025GoRA: Gradient-driven Adaptive Low Rank Adaptationcited by 12
  26. 2025Parameter-Efficient Fine-Tuning of Large Language Models via Deconvolution in Subspacecited by 11
  27. 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
  28. 2024Inference Optimization of Foundation Models on AI Acceleratorscited by 9
  29. 2022CrAM: A Compression-Aware Minimizercited by 7
  30. 2025FT-MDT: Extracting Decision Trees from Medical Texts via a Novel Low-rank Adaptation Methodcited by 7
  31. 2024CITI: Enhancing Tool Utilizing Ability in Large Language Models without Sacrificing General Performancecited by 6
  32. 2026IGU-LoRA: Adaptive Rank Allocation via Integrated Gradients and Uncertainty-Aware Scoringcited by 6
  33. 2023Just CHOP: Embarrassingly Simple LLM Compressioncited by 5
  34. 2023rm SP3: Enhancing Structured Pruning via PCA Projectioncited by 5
  35. 2024SPD-CFL: Stepwise Parameter Dropout for Efficient Continual Federated Learningcited by 5
  36. 2024Sparsity-Accelerated Training for Large Language Modelscited by 5
  37. 2025ElaLoRA: Elastic & Learnable Low-Rank Adaptation for Efficient Model Fine-Tuningcited by 5
  38. 2025Adaptive LoRA Merge with Parameter Pruning for Low-Resource Generationcited by 5

50 most cited of 79 All 79 (JSON)