mlsanityData to 14 Oct 2026

LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning

arXiv 2305.18403 ↗First posted 28 May 2023cs.LG cs.CVcited by 53

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs), such as LLaMA and T5, have shown exceptional performance across various tasks through fine-tuning. Although low-rank adaption (LoRA) has emerged to cheaply fine-tune these LLMs on downstream tasks, their deployment is still hindered by the vast model scale and computational costs. Post-training model pruning offers a way to compress LLMs. However, the current pruning methods designed for LLMs are not compatible with LoRA. This is due to their utilization of unstructured pruning on LLMs, impeding the merging of LoRA weights, or their dependence on the gradients of pre-trained weights to guide pruning, which can impose significant memory overhead. To this end, we propose LoRAPrune, a new framework that delivers an accurate structured pruned model in a highly memory-efficient manner. Specifically, we first design a LoRA-guided pruning criterion, which uses the weights and gradients of LoRA, rather than the gradients of pre-trained weights for importance estimation. We subsequently integrate this criterion into an iterative pruning process, effectively removing redundant channels and heads. Extensive experimental results demonstrate the superior performance of our LoRAPrune over existing approaches on the LLaMA series models. At a 50% compression rate, LoRAPrune demonstrates superior performance over LLM-Pruner, achieving a reduction in perplexity by 4.81 on WikiText2 and 3.46 on PTB, while also decreasing memory usage by 52.6%. Besides, LoRAPrune also matches semi-structural pruning across multiple LLMs, proving its wide applicability. The code is available at https://github.com/aim-uofa/LoRAPrune.

Key facts. Cited by 53 papers in the map (data through 14 Oct 2026). Builds on 29 of its 47 references that are in the map. First posted on arXiv 28 May 2023.

Builds on

29 of 47 references.

References · 29

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  7. 2016Pointer Sentinel Mixture Modelscited by 3,096
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  9. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  11. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  12. 2016Pruning Filters for Efficient ConvNetscited by 1,143
17 more
  1. 2021GLM: General Language Model Pretraining with Autoregressive Blank Infillingcited by 1,031
  2. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  3. 2022AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognitioncited by 719
  4. 2020What is the State of Neural Network Pruning?cited by 583
  5. 2019Importance Estimation for Neural Network Pruningcited by 541
  6. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  7. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  8. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
  9. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 126
  10. 2023LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructionscited by 124
  11. 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
  12. 2023Towards Efficient Visual Adaption via Structural Re-parameterizationcited by 73
  13. 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
  14. 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Designcited by 41
  15. 2022Parameter-Efficient Sparsity for Large Language Models Fine-Tuningcited by 27
  16. 2022Generative Visual Prompt: Unifying Distributional Control of Pre-Trained Generative Modelscited by 27
  17. 2020Lottery Tickets in Linear Models: An Analysis of Iterative Magnitude Pruningcited by 23

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 19; 2025: 20; 2026: 12.

53 papers.

Sort:

By area:

  1. 2024A Survey on Knowledge Distillation of Large Language Modelscited by 284
  2. 2024A Survey on Efficient Inference for Large Language Modelscited by 205
  3. 2023Efficient Large Language Models: A Surveycited by 186
  4. 2024MiniCache: KV Cache Compression in Depth Dimension for Large Language Modelscited by 125
  5. 2024A Survey of Resource-efficient LLM and Multimodal Foundation Modelscited by 86
  6. 2024A Survey on LoRA of Large Language Modelscited by 67
  7. 2024Parameter-Efficient Fine-Tuning in Large Models: A Survey of Methodologiescited by 47
  8. 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 43
  9. 2024Your Transformer is Secretly Linearcited by 23
  10. 2024A Survey: Collaborative Hardware and Software Design in the Era of Large Language Modelscited by 23
  11. 2024A Comprehensive Survey of Compression Algorithms for Language Modelscited by 15
  12. 2024Beware of Calibration Data for Pruning Large Language Modelscited by 15
38 more
  1. 2025Automatic Joint Structured Pruning and Quantization for Efficient Neural Network Training and Compressioncited by 14
  2. 2025LoRASculpt: Sculpting LoRA for Harmonizing General and Specialized Knowledge in Multimodal Large Language Modelscited by 11
  3. 2023A Speed Odyssey for Deployable Quantization of LLMscited by 10
  4. 2025Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMscited by 10
  5. 2025TAMP: Token-Adaptive Layerwise Pruning in Multimodal Large Language Modelscited by 9
  6. 2024Designing Large Foundation Models for Efficient Training and Inference: A Surveycited by 7
  7. 2025Fewer Weights, More Problems: A Practical Attack on LLM Pruningcited by 7
  8. 2024Not All Adapters Matter: Selective Adapter Freezing for Memory-Efficient Fine-Tuning of Language Modelscited by 5
  9. 2025Train Small, Infer Large: Memory-Efficient LoRA Training for Large Language Modelscited by 5
  10. 2024Deploying Foundation Model Powered Agent Services: A Surveycited by 4
  11. 2025PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recoverycited by 4
  12. 2025T'yr-the-Pruner: Structural Pruning LLMs via Global Sparsity Distribution Optimizationcited by 4
  13. 2025Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergencecited by 4
  14. 2025CompLeak: Deep Learning Model Compression Exacerbates Privacy Leakagecited by 3
  15. 2025Restoring Pruned Large Language Models via Lost Component Compensationcited by 3
  16. 2024Inference Optimizations for Large Language Models: Effects, Challenges, and Practical Considerationscited by 2
  17. 2024Step-by-Step Unmasking for Parameter-Efficient Fine-tuning of Large Language Modelscited by 2
  18. 2025Adaptive and Resource-efficient Agentic AI Systems for Mobile and Embedded Devices: A Surveycited by 2
  19. 2026Artificial Entanglement in the Fine-Tuning of Large Language Modelscited by 2
  20. 2026Understanding and Guiding Layer Placement in Parameter-Efficient Fine-Tuning of Large Language Modelscited by 2
  21. 2025Federated Multimodal Learning with Dual Adapters and Selective Pruning for Communication and Computational Efficiencycited by 1
  22. 2025Towards Faster and More Compact Foundation Models for Molecular Property Predictioncited by 1
  23. 2025MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMscited by 1
  24. 2025EfficientXpert: Efficient Domain Adaptation for Large Language Models via Propagation-Aware Pruningcited by 1
  25. 2026SALAAD: Sparse And Low-Rank Adaptation via ADMM for Large Language Model Inferencecited by 1
  26. 2026GPrune-LLM: Generalization-Aware Structured Pruning for Large Language Modelscited by 1
  27. 2026An Adapter-free Fine-tuning Approach for Tuning 3D Foundation Modelscited by 1
  28. 2026GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptationcited by 1
  29. 2024Accurate and Efficient Fine-Tuning of Quantized Large Language Models Through Optimal Balancecited by 0
  30. 2024Mixed Sparsity Training: Achieving 4× FLOP Reduction for Transformer Pretrainingcited by 0
  31. 2024Adaptive Pruning for Large Language Models with Structural Importance Awarenesscited by 0
  32. 2025Towards a Small Language Model Lifecycle Frameworkcited by 0
  33. 2025GenFT: A Generative Parameter-Efficient Fine-Tuning Method for Pretrained Foundation Modelscited by 0
  34. 2025SDMPrune: Self-Distillation MLP Pruning for Efficient Large Language Modelscited by 0
  35. 2025COMPACT: Common-token Optimized Model Pruning Across Channels and Tokenscited by 0
  36. 2026Understanding Rate-Distortion Performance in Distributed Transformer Inferencecited by 0
  37. 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compressioncited by 0
  38. 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Modelscited by 0

50 most cited of 53 All 53 (JSON)