mlsanityData to 14 Oct 2026

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

arXiv 2406.10777 ↗First posted 16 Jun 2024cs.CLcited by 21

Not on the map. Why?

Abstract (arXiv)

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 row and column-wise sparse low-rank adaptation (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.

Key facts. Cited by 21 papers in the map (data through 14 Oct 2026). Builds on 50 of its 60 references that are in the map. First posted on arXiv 16 Jun 2024.

Builds on

50 of 60 references.

References · 50

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2022Training language models to follow instructions with human feedbackcited by 15,971
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  5. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  6. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  8. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  9. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  10. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  11. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  12. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
38 more
  1. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  2. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  3. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  4. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  6. 2022Mass-Editing Memory in a Transformercited by 1,001
  7. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  8. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  9. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  10. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
  11. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
  12. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
  13. 2021Knowledge Neurons in Pretrained Transformerscited by 601
  14. 2021Editing Factual Knowledge in Language Modelscited by 553
  15. 2019Importance Estimation for Neural Network Pruningcited by 541
  16. 2021Fast Model Editing at Scalecited by 498
  17. 2022Memory-Based Model Editing at Scalecited by 447
  18. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  19. 2023Editing Large Language Models: Problems, Methods, and Opportunitiescited by 372
  20. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  21. 2023Can We Edit Factual Knowledge by In-Context Learning?cited by 285
  22. 2022Aging with GRACE: Lifelong Model Editing with Discrete Key-Value Adaptorscited by 271
  23. 2023Does Localization Inform Editing? Surprising Differences in Causality-Based Localization vs. Knowledge Editing in Language Modelscited by 243
  24. 2023Evaluating the Ripple Effects of Knowledge Editing in Language Modelscited by 242
  25. 2020Modifying Memories in Transformer Modelscited by 224
  26. 2024Not All Language Model Features Are One-Dimensionally Linearcited by 212
  27. 2019Structured Pruning of Large Language Modelscited by 203
  28. 2023Transformer-Patcher: One Mistake worth One Neuroncited by 197
  29. 2024ReFT: Representation Finetuning for Language Modelscited by 197
  30. 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 196
  31. 2023Knowledge Editing for Large Language Models: A Surveycited by 194
  32. 2024A Comprehensive Study of Knowledge Editing for Large Language Modelscited by 163
  33. 2021On the Effectiveness of Adapter-based Tuning for Pretrained Language Model Adaptationcited by 147
  34. 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 104
  35. 2023Sparse Low-rank Adaptation of Pre-trained Language Modelscited by 96
  36. 2022Calibrating Factual Knowledge in Pretrained Language Modelscited by 92
  37. 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
  38. 2023DocTER: Evaluating Document-based Knowledge Editingcited by 26

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 7; 2025: 8; 2026: 6.

21 papers.

Sort:

By area:

  1. 2024Low-Rank Adaptation for Foundation Models: A Comprehensive Reviewcited by 37
  2. 2025Position: Episodic Memory is the Missing Piece for Long-Term LLM Agentscited by 36
  3. 2024Can Knowledge Editing Really Correct Hallucinations?cited by 28
  4. 2024Tuning Timestep-Distilled Diffusion Model Using Pairwise Sample Optimizationcited by 26
  5. 2024Can Editing LLMs Inject Harm?cited by 22
  6. 2025Unlocking Efficient, Scalable, and Continual Knowledge Editing with Basis-Level Representation Fine-Tuningcited by 19
  7. 2024S2FT: Efficient, Scalable and Generalizable LLM Fine-tuning by Structured Sparsitycited by 10
  8. 2025Fine-tuning Done Right in Model Editingcited by 9
  9. 2024PEANuT: Parameter-Efficient Adaptation with Weight-aware Neural Tweakerscited by 8
  10. 2025CLoQ: Enhancing Fine-Tuning of Quantized LLMs via Calibrated LoRA Initializationcited by 5
  11. 2024A Bayesian Interpretation of Adaptive Low-Rank Adaptationcited by 2
  12. 2025Coeff-Tuning: A Graph Filter Subspace View for Tuning Attention-Based Large Modelscited by 2
9 more
  1. 2025DiaBlo: Diagonal Blocks Are Sufficient For Finetuningcited by 2
  2. 2026BaRA: Bayesian Adaptive Rank Allocation for Parameter-Efficient Fine-Tuningcited by 2
  3. 2025Sparse Fine-Tuning of Transformers for Generative Taskscited by 1
  4. 2026Sparse Spectral LoRA: Routed Experts for Medical VLMscited by 1
  5. 2025In-Context Compositional Learning via Sparse Coding Transformercited by 0
  6. 2026When to Write and When to Suppress: Route-Specialized Dual Adapters for Memory-Assisted Knowledge Editingcited by 0
  7. 2026LoRSA: Toward Generalizable Parameter-Efficient Fine-Tuning for Biomedical Downstream Taskscited by 0
  8. 2026Hybrid-Policy Self-Editing for Composable Unstructured Knowledge Editingcited by 0
  9. 2026Improving Atomic-Fact Recall via Focused Views in Unstructured Knowledge Editingcited by 0