Saved in:
Bibliographic Details
Main Authors: Liu, Xinxin, Thomas, Aaron, Zhang, Cheng, Cheng, Jianyi, Zhao, Yiren, Gao, Xitong
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2412.13488
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912452380196864
author Liu, Xinxin
Thomas, Aaron
Zhang, Cheng
Cheng, Jianyi
Zhao, Yiren
Gao, Xitong
author_facet Liu, Xinxin
Thomas, Aaron
Zhang, Cheng
Cheng, Jianyi
Zhao, Yiren
Gao, Xitong
contents Parameter-Efficient Fine-Tuning (PEFT) has gained prominence through low-rank adaptation methods like LoRA. In this paper, we focus on sparsity-based PEFT (SPEFT), which introduces trainable sparse adaptations to the weight matrices in the model, offering greater flexibility in selecting fine-tuned parameters compared to low-rank methods. We conduct the first systematic evaluation of salience metrics for SPEFT, inspired by zero-cost NAS proxies, and identify simple gradient-based metrics is reliable, and results are on par with the best alternatives, offering both computational efficiency and robust performance. Additionally, we compare static and dynamic masking strategies, finding that static masking, which predetermines non-zero entries before training, delivers efficiency without sacrificing performance, while dynamic masking offers no substantial benefits. Across NLP tasks, a simple gradient-based, static SPEFT consistently outperforms other fine-tuning methods for LLMs, providing a simple yet effective baseline for SPEFT. Our work challenges the notion that complexity is necessary for effective PEFT, while our open-source framework establishes a reproducible benchmark for future research, which is available at [https://github.com/0-ml/speft].
format Preprint
id arxiv_https___arxiv_org_abs_2412_13488
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Refining Salience-Aware Sparse Fine-Tuning Strategies for Language Models
Liu, Xinxin
Thomas, Aaron
Zhang, Cheng
Cheng, Jianyi
Zhao, Yiren
Gao, Xitong
Computation and Language
Artificial Intelligence
Parameter-Efficient Fine-Tuning (PEFT) has gained prominence through low-rank adaptation methods like LoRA. In this paper, we focus on sparsity-based PEFT (SPEFT), which introduces trainable sparse adaptations to the weight matrices in the model, offering greater flexibility in selecting fine-tuned parameters compared to low-rank methods. We conduct the first systematic evaluation of salience metrics for SPEFT, inspired by zero-cost NAS proxies, and identify simple gradient-based metrics is reliable, and results are on par with the best alternatives, offering both computational efficiency and robust performance. Additionally, we compare static and dynamic masking strategies, finding that static masking, which predetermines non-zero entries before training, delivers efficiency without sacrificing performance, while dynamic masking offers no substantial benefits. Across NLP tasks, a simple gradient-based, static SPEFT consistently outperforms other fine-tuning methods for LLMs, providing a simple yet effective baseline for SPEFT. Our work challenges the notion that complexity is necessary for effective PEFT, while our open-source framework establishes a reproducible benchmark for future research, which is available at [https://github.com/0-ml/speft].
title Refining Salience-Aware Sparse Fine-Tuning Strategies for Language Models
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2412.13488