Towards Robust Pruning: An Adaptive Knowledge-Retention Pruning Strategy for Language Models
Not on the map. Why?
Abstract (arXiv)
The pruning objective has recently extended beyond accuracy and sparsity to robustness in language models. Despite this, existing methods struggle to enhance robustness against adversarial attacks when continually increasing model sparsity and require a retraining process. As humans step into the era of large language models, these issues become increasingly prominent. This paper proposes that the robustness of language models is proportional to the extent of pre-trained knowledge they encompass. Accordingly, we introduce a post-training pruning strategy designed to faithfully replicate the embedding space and feature space of dense language models, aiming to conserve more pre-trained knowledge during the pruning process. In this setup, each layer's reconstruction error not only originates from itself but also includes cumulative error from preceding layers, followed by an adaptive rectification. Compared to other state-of-art baselines, our approach demonstrates a superior balance between accuracy, sparsity, robustness, and pruning cost with BERT on datasets SST2, IMDB, and AGNews, marking a significant stride towards robust pruning in language models.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 33 of its 48 references that are in the map. First posted on arXiv 19 Oct 2023.
Builds on
33 of 48 references.
References · 33
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 671
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2022Using DeepSpeed and Megatron to Train Megatron-Turing NLG 530B, A Large-Scale Generative Language Modelcited by 559
21 more
- 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 491
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2018TextBugger: Generating Adversarial Text Against Real-world Applicationscited by 381
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 322
- 2020BAE: BERT-based Adversarial Examples for Text Classificationcited by 316
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2019FreeLB: Enhanced Adversarial Training for Natural Language Understandingcited by 264
- 2019Probing Neural Network Comprehension of Natural Language Argumentscited by 214
- 2023On the Robustness of ChatGPT: An Adversarial and Out-of-distribution Perspectivecited by 211
- 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 185
- 2020Characterising Bias in Compressed Modelscited by 167
- 2020When BERT Plays the Lottery, All Tickets Are Winningcited by 114
- 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
- 2019BERTs of a feather do not generalize together: Large variability in generalization across models with similar test set performancecited by 89
- 2020EarlyBERT: Efficient BERT Training via Early-bird Lottery Ticketscited by 79
- 2021Towards Interpreting and Mitigating Shortcut Learning Behavior of NLU Modelscited by 78
- 2019Model Compression with Adversarial Robustness: A Unified Optimization Frameworkcited by 71
- 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
- 2021Beyond Preserved Accuracy: Evaluating Loyalty and Robustness of BERT Compressioncited by 38
- 2023Seasoning Model Soups for Robustness to Adversarial and Natural Distribution Shiftscited by 23
- 2022Efficient Adversarial Training with Robust Early-Bird Ticketscited by 5
Built on by
Citing papers per year: 2024: 3; 2025: 1; 2026: 3.
7 papers.
- 2024Superficial Safety Alignment Hypothesiscited by 14
- 2024Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retrainingcited by 8
- 2026Purifying Generative LLMs from Backdoors without Prior Knowledge or Clean Referencecited by 7
- 2024Surprisingly Fragile: Assessing and Addressing Prompt Instability in Multimodal Foundation Modelscited by 3
- 2025Deriving Coding-Specific Sub-Models from LLMs using Resource-Efficient Pruningcited by 0
- 2026Position: Retire the "Positive Backdoor" Label -- Secret Alignment Requires Strict and Systematic Evaluationcited by 0
- 2026FOCUS & RePAIR: Mitigating Text Degeneration via Token-Level Guidance for Pruned Large Language Modelscited by 0
- 2026FOCUS & RePAIR: Mitigating Text Degeneration via Token-Level Guidance for Pruned Large Language Models27 Aug 2026
- 2026Position: Retire the "Positive Backdoor" Label -- Secret Alignment Requires Strict and Systematic Evaluation27 May 2026
- 2026Purifying Generative LLMs from Backdoors without Prior Knowledge or Clean Reference13 Mar 2026
- 2025Deriving Coding-Specific Sub-Models from LLMs using Resource-Efficient Pruning9 Jan 2025
- 2024Superficial Safety Alignment Hypothesis7 Oct 2024
- 2024Surprisingly Fragile: Assessing and Addressing Prompt Instability in Multimodal Foundation Models26 Aug 2024
- 2024Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retraining26 Jul 2024