mlsanityData to 14 Oct 2026

How Much Knowledge Can You Pack into a LoRA Adapter without Harming LLM?

arXiv 2502.14502 ↗First posted 20 Feb 2025cs.CLcited by 13

Not on the map. Why?

Abstract (arXiv)

The performance of Large Language Models (LLMs) on many tasks is greatly limited by the knowledge learned during pre-training and stored in the model's parameters. Low-rank adaptation (LoRA) is a popular and efficient training technique for updating or domain-specific adaptation of LLMs. In this study, we investigate how new facts can be incorporated into the LLM using LoRA without compromising the previously learned knowledge. We fine-tuned Llama-3.1-8B-instruct using LoRA with varying amounts of new knowledge. Our experiments have shown that the best results are obtained when the training data contains a mixture of known and new facts. However, this approach is still potentially harmful because the model's performance on external question-answering benchmarks declines after such fine-tuning. When the training data is biased towards certain entities, the model tends to regress to few overrepresented answers. In addition, we found that the model becomes more confident and refuses to provide an answer in only few cases. These findings highlight the potential pitfalls of LoRA-based LLM updates and underscore the importance of training data composition and tuning parameters to balance new knowledge integration and general model capabilities.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 24 of its 34 references that are in the map. First posted on arXiv 20 Feb 2025.

Builds on

24 of 34 references.

References · 24

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  2. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  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. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,975
  6. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  7. 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,128
  8. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
  9. 2021Learning To Retrieve Prompts for In-Context Learningcited by 648
  10. 2023Editing Large Language Models: Problems, Methods, and Opportunitiescited by 372
  11. 2024Does Fine-Tuning LLMs on New Knowledge Encourage Hallucinations?cited by 232
  12. 2020Retrieve, Program, Repeat: Complex Knowledge Base Question Answering via Alternate Meta-learningcited by 216
12 more
  1. 2023Evaluating Large Language Models: A Comprehensive Surveycited by 202
  2. 2023Knowledge Editing for Large Language Models: A Surveycited by 194
  3. 2023Head-to-Tail: How Knowledgeable are Large Language Models (LLMs)? A.K.A. Will LLMs Replace Knowledge Graphs?cited by 168
  4. 2023Physics of Language Models: Part 3.2, Knowledge Manipulationcited by 143
  5. 2021Think you have Solved Direct-Answer Question Answering? Try ARC-DA, the Direct-Answer AI2 Reasoning Challengecited by 80
  6. 2023Detecting Edit Failures In Large Language Models: An Improved Specificity Benchmarkcited by 62
  7. 2024A Comprehensive Survey on Data Augmentationcited by 40
  8. 2024A Survey on Data Augmentation in Large Model Eracited by 31
  9. 2023Catastrophic Forgetting in Deep Learning: A Comprehensive Taxonomycited by 24
  10. 2024Prompting Large Language Models with Knowledge Graphs for Question Answering Involving Long-tail Factscited by 14
  11. 2024Deciphering the Interplay of Parametric and Non-parametric Memory in Retrieval-augmented Language Modelscited by 10
  12. 2024DeepPavlov at SemEval-2024 Task 8: Leveraging Transfer Learning for Detecting Boundaries of Machine-Generated Textscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 11.

13 papers.

Sort:

By area: