Outlier-weighed Layerwise Sampling for LLM Fine-tuning

The rapid advancements in Large Language Models (LLMs) have revolutionized various natural language processing tasks.However, the substantial size of LLMs presents significant challenges in training or fine-tuning.While parameter-efficient approaches such as low-rank adaptation (LoRA) have gained popularity, they often compromise performance compared to full-rank fine-tuning.In this paper, we propose Outlier-weighed Layerwise Sampling (OWS), a new memory-efficient finetuning approach, inspired by the layerwise outlier distribution of LLMs.Unlike LoRA, which adds extra adapters to all layers, OWS strategically assigns higher sampling probabilities to layers with more outliers, selectively sampling only a few layers and fine-tuning their pre-trained weights.To further increase the number of fine-tuned layers without a proportional rise in memory costs, we incorporate gradient low-rank projection, further boosting the approach's performance.Our extensive experiments across various architectures, including LLaMa2, and Mistral, demonstrate that OWS consistently outperforms baseline approaches, including full fine-tuning.Specifically, it achieves up to a 1.1% average accuracy gain on the Commonsense Reasoning benchmark, a 3.0% improvement on MMLU, and a notable 10% boost on MT-Bench, while being more memory efficient.OWS allows us to fine-tune 7B LLMs with only 21GB of memory.Our code is available at https: //github.com/pixeli99/OWS.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.996
Citations
2
Primary Topic
Non-Destructive Testing Techniques
Type
article
Field-Weighted Citation Impact
1.43
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Outlier-weighed Layerwise Sampling for LLM Fine-tuning

Yin Lu, Xiaowei Gao, Shiwei Liu, Pengxiang Li
2 citations
Non-Destructive Testing Techniques
1.43
article

Outlier-weighed Layerwise Sampling for LLM Fine-tuning

Yin Lu, Xiaowei Gao, Shiwei Liu, Pengxiang Li
article en
2 citations

Abstract

The rapid advancements in Large Language Models (LLMs) have revolutionized various natural language processing tasks.However, the substantial size of LLMs presents significant challenges in training or fine-tuning.While parameter-efficient approaches such as low-rank adaptation (LoRA) have gained popularity, they often compromise performance compared to full-rank fine-tuning.In this paper, we propose Outlier-weighed Layerwise Sampling (OWS), a new memory-efficient finetuning approach, inspired by the layerwise outlier distribution of LLMs.Unlike LoRA, which adds extra adapters to all layers, OWS strategically assigns higher sampling probabilities to layers with more outliers, selectively sampling only a few layers and fine-tuning their pre-trained weights.To further increase the number of fine-tuned layers without a proportional rise in memory costs, we incorporate gradient low-rank projection, further boosting the approach's performance.Our extensive experiments across various architectures, including LLaMa2, and Mistral, demonstrate that OWS consistently outperforms baseline approaches, including full fine-tuning.Specifically, it achieves up to a 1.1% average accuracy gain on the Commonsense Reasoning benchmark, a 3.0% improvement on MMLU, and a notable 10% boost on MT-Bench, while being more memory efficient.OWS allows us to fine-tune 7B LLMs with only 21GB of memory.Our code is available at https: //github.com/pixeli99/OWS.

Openalex Percentile: Top 18%
Non-Destructive Testing Techniques
1.43
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.