paper-with-me

홈 › Papers

RoseLoRA: Row and Column-wise Sparse Low-rank Adaptation of Pre-trained Language Model for Knowledge Editing and Fine-tuning

2024-06-16 · Haoyu Wang, Tianci Liu, Ruirui Li, Monica Cheng, Tuo Zhao, Jing Gao

Pre-trained language models, trained on large-scale corpora, demonstrate strong generalizability across various NLP tasks. Fine-tuning these models for specific tasks typically involves updating all parameters, which is resource-intensive. Parameter-efficient fine-tuning (PEFT) methods, such as the popular LoRA family, introduce low-rank matrices to learn only a few parameters efficiently. However, during inference, the product of these matrices updates all pre-trained parameters, complicating tasks like knowledge editing that require selective updates. We propose a novel PEFT method, which conducts \textbf{r}ow and c\textbf{o}lumn-wise spar\textbf{se} \textbf{lo}w-\textbf{r}ank \textbf{a}daptation (RoseLoRA), to address this challenge. RoseLoRA identifies and updates only the most important parameters for a specific task, maintaining efficiency while preserving other model knowledge. By adding a sparsity constraint on the product of low-rank matrices and converting it to row and column-wise sparsity, we ensure efficient and precise model updates. Our theoretical analysis guarantees the lower bound of the sparsity with respective to the matrix product. Extensive experiments on five benchmarks across twenty datasets demonstrate that RoseLoRA outperforms baselines in both general fine-tuning and knowledge editing tasks.

📄 PDF Abstract BibTeX arXiv:2406.10777

Code (1)

lliutianc/roselora 공식 구현 pytorch

Tasks

knowledge editingLanguage ModelingLanguage Modellingparameter-efficient fine-tuning

Similar Papers 제목 키워드 기반

Low Rank Matrix Recovery with Simultaneous Presence of Outliers and Sparse Corruption

2017-02-07 · Mostafa Rahmani, George Atia

We study a data model in which the data matrix D can be expressed as D = L + S + C, where L is a low rank matrix, S an element-wise sparse matrix and C a matrix whose non-zero columns are outlying data points. To date, r…

A Fast Algorithm for Low Rank + Sparse column-wise Compressive Sensing

2023-11-07 · Silpa Babu, Namrata Vaswani

This paper focuses studies the following low rank + sparse (LR+S) column-wise compressive sensing problem. We aim to recover an $n \times q$ matrix, $\X^* =[ \x_1^*, \x_2^*, \cdots , \x_q^*]$ from $m$ independent linear …

Compressive Sensing

Hyperspectral Image Denoising Using Non-convex Local Low-rank and Sparse Separation with Spatial-Spectral Total Variation Regularization

2022-01-08 · Chong Peng, Yang Liu, Yongyong Chen, Xinxin Wu 외

In this paper, we propose a novel nonconvex approach to robust principal component analysis for HSI denoising, which focuses on simultaneously developing more accurate approximations to both rank and column-wise sparsity…

DenoisingHyperspectral Image DenoisingImage Denoising

Low-Rank Winograd Transformation for 3D Convolutional Neural Networks

2023-01-26 · Ziran Qin, Mingbao Lin, Weiyao Lin

This paper focuses on Winograd transformation in 3D convolutional neural networks (CNNs) that are more over-parameterized compared with the 2D version. The over-increasing Winograd parameters not only exacerbate training…

Sensitivity-Aware Efficient Fine-Tuning via Compact Dynamic-Rank Adaptation

2025-01-01 · CVPR 2025 1 · Tianran Chen, Jiarui Chen, Baoquan Zhang, Zhehao Yu 외

Parameter-Efficient Fine-Tuning (PEFT) is a fundamental research problem in computer vision, which aims to tune a few of parameters for efficient storage and adaptation of pre-trained vision models. Recently, sensiti…

parameter-efficient fine-tuningSensitivity