MoreauPruner: Robust Pruning of Large Language Models against Weight Perturbations
Not on the map. Why?
Abstract (arXiv)
Few-shot gradient methods have been extensively utilized in existing model pruning methods, where the model weights are regarded as static values and the effects of potential weight perturbations are not considered. However, the widely used large language models (LLMs) have several billion model parameters, which could increase the fragility of few-shot gradient pruning. In this work, we experimentally show that one-shot gradient pruning algorithms could lead to unstable results under perturbations to model weights. And the minor error of switching between data formats bfloat16 and float16 could result in drastically different outcomes. To address such instabilities, we leverage optimization analysis and propose an LLM structural pruning method, called MoreauPruner, with provable robustness against weight perturbations. In MoreauPruner, the model weight importance is estimated based on the neural network's Moreau envelope, which can be flexibly combined with ℓ1-norm regularization techniques to induce the sparsity required in the pruning task. We extensively evaluate the MoreauPruner algorithm on several well-known LLMs, including LLaMA-7B, LLaMA-13B, LLaMA3-8B, and Vicuna-7B. Our numerical results suggest the robustness of MoreauPruner against weight perturbations, and indicate the MoreauPruner's successful accuracy-based scores in comparison to several existing pruning methods. We have released the code in urlhttps://github.com/ShiningSord/MoreauPruner.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 34 of its 49 references that are in the map. First posted on arXiv 11 Jun 2024.
Builds on
34 of 49 references.
References · 34
- 2023GPT-4 Technical Reportcited by 18,132
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
22 more
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,041
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2020Personalized Federated Learning with Moreau Envelopescited by 612
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
- 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2019Q8BERT: Quantized 8Bit BERTcited by 296
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2023LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructionscited by 124
- 2020Contrastive Distillation on Intermediate Representations for Language Model Compressioncited by 57
- 2018On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradientcited by 42
- 2020Lottery Tickets in Linear Models: An Analysis of Iterative Magnitude Pruningcited by 23
- 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networkscited by 17
- 2024Random Masking Finds Winning Tickets for Parameter Efficient Fine-tuningcited by 16
- 2023Accurate Retraining-free Pruning for Pretrained Encoder-based Language Modelscited by 11
- 2023MoreauGrad: Sparse and Robust Interpretation of Neural Networks via Moreau Envelopecited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 1.
5 papers.
- 2024GQSA: Group Quantization and Sparsity for Accelerating Large Language Model Inferencecited by 5
- 2025Sample-aware Adaptive Structured Pruning for Large Language Modelscited by 1
- 2025PermLLM: Learnable Channel Permutation for N:M Sparse Large Language Modelscited by 1
- 2026Towards Generalizable Reasoning: Group Causal Counterfactual Policy Optimization for LLM Reasoningcited by 1
- 2025TorchResist: Open-Source Differentiable Resist Simulatorcited by 0
- 2026Towards Generalizable Reasoning: Group Causal Counterfactual Policy Optimization for LLM Reasoning6 Feb 2026
- 2025PermLLM: Learnable Channel Permutation for N:M Sparse Large Language Models11 Oct 2025
- 2025Sample-aware Adaptive Structured Pruning for Large Language Models8 Mar 2025
- 2025TorchResist: Open-Source Differentiable Resist Simulator6 Feb 2025
- 2024GQSA: Group Quantization and Sparsity for Accelerating Large Language Model Inference23 Dec 2024