跳到正文
研踪PaperTrail
← 研踪 PaperTrail

ACL Anthology · ACL 2026:acl:2026.acl-long.1179 · 记录 #1

Can Spectral-Clipping Enable Better Learning While Forgetting Less for Low-Rank Adaptation?

来源日期(仅到月份) 2026-07
来源记录日期 2026-07
雷达观测 2026-11-01 21:56
ACL Anthology · ACL 2026 ↗PDF ↗

摘要

In recent years, low-rank adaptation (LoRA) has emerged as a significant paradigm that freezes pre-trained weights and introduces small, learnable adapters instead of fine-tuning the full set of parameters. In this work, we uncover several key insights regarding the \textit{singular} components of network parameters based on Singular Value Decomposition (SVD).Firstly, the \textit{principal} singular components with large singular values in pre-trained network parameters can be effectively reused during fine-tuning, whereas the \textit{minor} components with smaller singular values are more task-specific and require substantial adaptation. Secondly, we first establish the theoretical connection that the uncontrolled growth of singular values in LoRA adapters leads to the forgetting of pre-trained knowledge — a well-known issue referred to as \textit{catastrophic forgetting}.Building on these observations, we propose \textbf{SCLoRA}, which injects parameterized singular components with spectral clipping into the pre-trained model in a way that is aware of the spectral distribution of the pre-trained model. \textbf{SCLoRA} effectively adapts to new tasks by focusing updates on components that require adaptation, while simultaneously alleviating catastrophic forgetting. We conduct extensive experiments and demonstrate that \textbf{SCLoRA} not only improves downstream performance but also effectively retains pre-trained knowledge.

论文发现出处

这些页面提供论文线索,不代表同行评审或质量认证。

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

发表信息与关联版本

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

平台记录号代表本站观测到的元数据变化,不是作者修订号。来源日期仅到月份或年份时,按该月或该年首日存档。

记录 #1 · 2026-07 · 最新观测版本

Can Spectral-Clipping Enable Better Learning While Forgetting Less for Low-Rank Adaptation?

In recent years, low-rank adaptation (LoRA) has emerged as a significant paradigm that freezes pre-trained weights and introduces small, learnable adapters instead of fine-tuning the full set of parameters. In this work, we uncover several key insights regarding the \textit{singular} components of network parameters based on Singular Value Decomposition (SVD).Firstly, the \textit{principal} singular components with large singular values in pre-trained network parameters can be effectively reused during fine-tuning, whereas the \textit{minor} components with smaller singular values are more task-specific and require substantial adaptation. Secondly, we first establish the theoretical connection that the uncontrolled growth of singular values in LoRA adapters leads to the forgetting of pre-trained knowledge — a well-known issue referred to as \textit{catastrophic forgetting}.Building on these observations, we propose \textbf{SCLoRA}, which injects parameterized singular components with spectral clipping into the pre-trained model in a way that is aware of the spectral distribution of the pre-trained model. \textbf{SCLoRA} effectively adapts to new tasks by focusing updates on components that require adaptation, while simultaneously alleviating catastrophic forgetting. We conduct extensive experiments and demonstrate that \textbf{SCLoRA} not only improves downstream performance but also effectively retains pre-trained knowledge.

查看此版本解读 →查看此版本原文 ↗