CoChat

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

Open access
Zhang, Mingyang, Chen, Hao, Shen, Chunhua, Yang, Zhen, Ou, Linlin, Yu, Xinyi, Zhuang, Bohan · 2024 · Findings of the Association for Computational Linguistics ACL 2024
Cited by 61

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2024.findings-acl.178

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 61

Metadata

Authors
Zhang, M., Chen, H., Shen, C., Yang, Z., Ou, L., Yu, X., & Zhuang, B.
Venue
Findings of the Association for Computational Linguistics ACL 2024
Published
2024
Pages
3013-3026
OpenAlex
W4402670757
Cited by
61
References
8
FWCI
13.32
Type
conference paper
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning. https://app.cochat.ai/papers/10.18653/v1/2024.findings-acl.178
The paper
Zhang, M., Chen, H., Shen, C., Yang, Z., Ou, L., Yu, X., & Zhuang, B. (2024). LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning. Findings of the Association for Computational Linguistics ACL 2024. https://doi.org/10.18653/v1/2024.findings-acl.178

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.