mlsanityData to 14 Oct 2026

SECURA: Sigmoid-Enhanced CUR Decomposition with Uninterrupted Retention and Low-Rank Adaptation in Large Language Models

arXiv 2502.18168 ↗First posted 25 Feb 2025cs.CL cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

With the rapid development of large language models (LLMs), fully fine-tuning (FT) these models is becoming increasingly infeasible due to high computational demands. Moreover, FT also increases the risk of catastrophic forgetting. As an alternative, Low-Rank Adaptation (LoRA) has been proposed. By fine-tuning only a small subset of parameters, LoRA achieves performance similar to FT while significantly reducing resource requirements. However, since LoRA inherits FT's design, the issue of catastrophic forgetting still remains. To address these limitations, we propose SECURA: Sigmoid-Enhanced CUR Decomposition LoRA, a novel PEFT variant designed to mitigate catastrophic forgetting while improving fine-tuning performance. Our method introduces a novel normalization technique, Sigmoid-based Magnitude Norm (S-MagNorm), which enhances parameter retention and fine-tuning efficiency. SECURA has been evaluated on a diverse range of tasks, including mathematical problem-solving (GSM8K), complex question-answering (CNNDM), translation (NewsDE), and complex multiple-choice reasoning (LogiQA). Experimental results demonstrate that it achieves an average fine-tuning improvement of 3.59% across four MCQ tasks and 2.51% across five QA tasks on Gemma2 2B, Qwen2 1.5B, Qwen2 7B, Llama3 8B, and Llama3.1 8B, outperforming DoRA. Additionally, SECURA demonstrates superior knowledge retention capabilities, achieving state-of-the-art performance in 16 continual learning tests and maintaining more than 70% accuracy on LLMs' basic knowledge compared to Experience Replay (ER), sequential learning (SEQ), EWC, I-LoRA, and CUR-LoRA.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 38 references that are in the map. First posted on arXiv 25 Feb 2025.

Builds on

24 of 38 references.

References · 24

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  5. 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
  6. 2016Learning without Forgettingcited by 2,496
  7. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,998
  8. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
  9. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  10. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,292
  11. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  12. 2016Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networkscited by 543
12 more
  1. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  2. 2020Revisiting Fundamentals of Experience Replaycited by 175
  3. 2020Dynamic Model Pruning with Feedbackcited by 125
  4. 2024Analyzing and Reducing Catastrophic Forgetting in Parameter Efficient Tuningcited by 60
  5. 2024AdaMergeX: Cross-Lingual Transfer with Large Language Models via Adaptive Adapter Mergingcited by 34
  6. 2021Elastic Weight Consolidation (EWC): Nuts and Boltscited by 23
  7. 2017Adaptive Traffic Signal Control: Deep Reinforcement Learning Algorithm with Experience Replay and Target Networkcited by 16
  8. 2023Low-Rank Adaptation for Multilingual Summarization: An Empirical Studycited by 13
  9. 2024CURLoRA: Stable LLM Continual Fine-Tuning and Catastrophic Forgetting Mitigationcited by 10
  10. 2018The Cost of Delay in Status Updates and their Value: Non-linear Ageingcited by 5
  11. 2024Static Pruning in Dense Retrieval using Matrix Decompositioncited by 3
  12. 2019CUR Decompositions, Approximations, and Perturbationscited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.