PRILoRA: Pruned and Rank-Increasing Low-Rank Adaptation

Findings Pub Date : 2024-01-20 DOI:10.48550/arXiv.2401.11316
Nadav Benedek, Lior Wolf
{"title":"PRILoRA: Pruned and Rank-Increasing Low-Rank Adaptation","authors":"Nadav Benedek, Lior Wolf","doi":"10.48550/arXiv.2401.11316","DOIUrl":null,"url":null,"abstract":"With the proliferation of large pre-trained language models (PLMs), fine-tuning all model parameters becomes increasingly inefficient, particularly when dealing with numerous downstream tasks that entail substantial training and storage costs. Several approaches aimed at achieving parameter-efficient fine-tuning (PEFT) have been proposed. Among them, Low-Rank Adaptation (LoRA) stands out as an archetypal method, incorporating trainable rank decomposition matrices into each target module. Nevertheless, LoRA does not consider the varying importance of each layer. To address these challenges, we introduce PRILoRA, which linearly allocates a different rank for each layer, in an increasing manner, and performs pruning throughout the training process, considering both the temporary magnitude of weights and the accumulated statistics of the input to any given layer. We validate the effectiveness of PRILoRA through extensive experiments on eight GLUE benchmarks, setting a new state of the art.","PeriodicalId":508951,"journal":{"name":"Findings","volume":"65 4","pages":"252-263"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Findings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2401.11316","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the proliferation of large pre-trained language models (PLMs), fine-tuning all model parameters becomes increasingly inefficient, particularly when dealing with numerous downstream tasks that entail substantial training and storage costs. Several approaches aimed at achieving parameter-efficient fine-tuning (PEFT) have been proposed. Among them, Low-Rank Adaptation (LoRA) stands out as an archetypal method, incorporating trainable rank decomposition matrices into each target module. Nevertheless, LoRA does not consider the varying importance of each layer. To address these challenges, we introduce PRILoRA, which linearly allocates a different rank for each layer, in an increasing manner, and performs pruning throughout the training process, considering both the temporary magnitude of weights and the accumulated statistics of the input to any given layer. We validate the effectiveness of PRILoRA through extensive experiments on eight GLUE benchmarks, setting a new state of the art.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
PRILoRA:经过剪枝和等级递增的低库适应性
随着大量预训练语言模型(PLM)的涌现,对所有模型参数进行微调的效率越来越低,尤其是在处理大量需要大量训练和存储成本的下游任务时。目前已经提出了几种旨在实现参数高效微调(PEFT)的方法。其中,低秩适应(Low-Rank Adaptation,LoRA)是一种典型的方法,它将可训练的秩分解矩阵纳入每个目标模块。然而,LoRA 并未考虑各层的不同重要性。为了应对这些挑战,我们引入了 PRILoRA,它以线性递增的方式为每一层分配不同的秩,并在整个训练过程中执行剪枝,同时考虑权重的临时大小和任何给定层输入的累积统计数据。我们在八个 GLUE 基准上进行了大量实验,验证了 PRILoRA 的有效性,开创了新的技术领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Changes in Traffic Jams and Injuries Impact on Acceptability of Automated Vehicles: A Strong Curvilinear Relation with no signs of Loss Aversion. Day-of-Week, Month, and Seasonal Demand Variations: Comparing Flow Estimates Across New Travel Data Sources Human Mobility Patterns during the 2024 Total Solar Eclipse in Canada Substituting Car Trips: Does Intermodal Mobility Decrease External Costs and How Does It Affect Travel Times? An Analysis Based on GPS Tracking Data Revealed Preferences for Utilitarian Cycling Energy Expenditure versus Travel Time
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1