REVIEW 5 cited by
Analyzing and Reducing Catastrophic Forgetting in Parameter Efficient Tuning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Existing research has shown that large language models (LLMs) exhibit remarkable performance in language understanding and generation. However, when LLMs are continuously fine-tuned on complex and diverse domain-specific downstream tasks, the inference performance on historical tasks decreases dramatically, which is known as a catastrophic forgetting problem. A trade-off needs to be kept between learning plasticity and memory stability. Plenty of existing works have explored strategies like memory replay, regularization and parameter isolation, but little is known about the geometric connection of various adjacent minima in the continual LLMs fine-tuning scenarios. In this work, we investigate the geometric connections of different minima through the lens of mode connectivity, which means different minima can be connected by a low-loss valley. Through extensive experiments, we uncover the mode connectivity phenomenon in the LLMs continual learning scenario and find that it can strike a balance between plasticity and stability. Building upon these findings, we propose a simple yet effective method called Interpolation-based LoRA (I-LoRA), which constructs a dual-memory experience replay framework based on LoRA parameter interpolations. Extensive experiments and analysis on eight domain-specific CL benchmarks demonstrate that I-LoRA consistently show significant improvement over the previous state-of-the-art approaches with up to $11\%$ performance gains, providing a strong baseline and insights for future research on the large language model continual learning problem. Our code is available at \url{https://github.com/which47/LLMCL}.
Forward citations
Cited by 5 Pith papers
-
Diffusion-Inspired Masked Fine-Tuning for Knowledge Injection in Autoregressive LLMs
Masked fine-tuning enables autoregressive LLMs to inject new factual knowledge without paraphrases and with reversal-curse resistance, matching diffusion LLM advantages on QA tasks.
-
A Taxonomy of Cognitive Capability Gaps in Generative and Agentic AI
The paper organizes persistent AI limitations into a five-part taxonomy of cognitive capability gaps and proposes a conceptual ACIA architecture and cognition-centric metrics, none of which are validated.
-
Continual Learning for Generative AI: From LLMs to MLLMs and Beyond
A survey that categorizes continual learning methods for generative models into architecture-based, regularization-based, and replay-based paradigms across four model families.
-
Improved Supervised Fine-Tuning for Large Language Models to Mitigate Catastrophic Forgetting
A self-generated and committee-filtered synthetic rehearsal dataset lets a fine-tuned LLM nearly preserve its general benchmark scores while adding domain data.
-
Securing LLMs in the Wild: Privacy and Security Challenges at the Edge
Edge LLM security is framed as a Security-Efficiency Paradox, with a three-wall constraint model, a composite SOES score, and a small FP/INT4 benchmark of six models.
Discussion (0). Continue with ORCID to comment.