ACL Findings2024
LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning
Mingyang Zhang, Hao Chen, Chunhua Shen, Zhen Yang, Linlin Ou, Xinyi Yu, Bohan Zhuang
摘要
Large Language Models (LLMs), such as LLaMA and T5, have shown exceptional performance across various tasks through finetuning. 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.
问 Lune
尽管问,回答会引用原文。
Lune 会读完全文和相关的 Paper,每个回答都附上所依据的原文段落。
引用它的顶会 Paper25
- Týr-the-Pruner: Structural Pruning LLMs via Global Sparsity Distribution OptimizationGuanchen Li, Yixing Xu, Zeping Li, Ji Liu 等NeurIPS 2025 · 7 次引用
- Not All Directions Matter: Towards Structured and Task-Aware Low-Rank Model AdaptationXi Xiao, Chenrui Ma, Yunbei Zhang, Chen Liu 等ACL 2026 · 6 次引用
- PASER: Post-Training Data Selection for Efficient Pruned Large Language Model RecoveryBowei He, Lihao Yin, Huiling Zhen, Xiaokun Zhang 等ICLR 2026 · 5 次引用
- LSSF: Safety Alignment for Large Language Models through Low-Rank Safety Subspace FusionGuanghao Zhou, Panjia Qiu, Cen Chen, Hongyu Li 等ACL 2025 · 5 次引用
- ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion GenerationXiaomeng Yang, Lei Lu, Qihui Fan, Changdi Yang 等NeurIPS 2025 · 4 次引用
它引用的 Paper23
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu 等ICLR 2022 · 18,833 次引用
- Measuring Massive Multitask Language UnderstandingDan Hendrycks, Collin Burns, Steven Basart, Andy Zou 等ICLR 2021 · 7,905 次引用
- QLoRA: Efficient Finetuning of Quantized LLMsTim Dettmers, Artidoro Pagnoni, Ari Holtzman, Luke ZettlemoyerNeurIPS 2023 · 5,863 次引用
- PIQA: Reasoning about Physical Commonsense in Natural LanguageYonatan Bisk, Rowan Zellers, Ronan Le Bras, Jianfeng Gao 等AAAI 2020 · 2,916 次引用
- AnimateDiff: Animate Your Personalized Text-to-Image Diffusion Models without Specific TuningYuwei Guo, Ceyuan Yang, Anyi Rao, Zhengyang Liang 等ICLR 2024 · 1,493 次引用
相关 Paper
- Reassessing Layer Pruning in LLMs: New Insights and MethodsYao Lu, Hao Cheng, Yujie Fang, Zeyu Wang 等ICLR 2026 · 24 次引用
- LLM-Pruner: On the Structural Pruning of Large Language ModelsXinyin Ma, Gongfan Fang, Xinchao WangNeurIPS 2023 · 994 次引用
- Train Small, Infer Large: Memory-Efficient LoRA Training for Large Language ModelsJun Zhang, Jue Wang, Huan Li, Lidan Shou 等ICLR 2025
- Wanda++: Pruning Large Language Models via Regional GradientsYifan Yang, Kai Zhen, Bhavana Ganesh, Aram Galstyan 等ACL Findings 2025 · 8 次引用
- Pruning Large Language Models to Intra-module Low-rank Architecture with Transitional ActivationsBowen Shen, Zheng Lin, Daren Zha, Wei Liu 等ACL Findings 2024 · 3 次引用
