PMSS: Pretrained Matrices Skeleton Selection for LLM Fine-tuning
원문 초록
Low-rank adaptation (LoRA) and its variants have recently gained much interest due to their ability to avoid excessive inference costs. However, LoRA still encounters the following challenges: (1) Limitation of low-rank assumption; and (2) Its initialization method may be suboptimal. To this end, we propose PMSS(Pre-trained Matrices Skeleton Selection), which enables high-rank updates with low costs while leveraging semantic and linguistic information inherent in pre-trained weight. It achieves this by selecting skeletons from the pre-trained weight matrix and only learning a small matrix instead. Experiments demonstrate that PMSS outperforms LoRA and other fine-tuning methods across tasks with much less trainable parameters. We demonstrate its effectiveness, especially in handling complex tasks such as DROP benchmark(+3.4%/+5.9% on LLaMA2-7B/13B) and math reasoning(+12.89%/+5.61%/+3.11% on LLaMA2-7B, Mistral-7B and Gemma-7B of GSM8K). The code and model will be released soon.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AgentGroupChat-V2: Divide-and-Conquer Is What LLM-Based Multi-Agent System Need
Learning a Continue-Thinking Token for Enhanced Test-Time Scaling
Discriminative Policy Optimization for Token-Level Reward Models
EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning
Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Space
Thinkless: LLM Learns When to Think
토론
이 논문과 연결된 포럼 글이 아직 없습니다.