arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.04516cs.LGcs.AI
收藏

GAIN:领域适应的乘法调制

GAIN: Multiplicative Modulation for Domain Adaptation

Sapient Intelligence;Department of Computing Science, University of Alberta(计算科学系,阿尔伯塔大学)

Hengshuai Yao, Xing Chen, Ahmed Murtadha, Guan Wang

AI总结:

GAIN通过乘法调制方法提升领域适应性能,有效降低遗忘,优于LoRA和EWC,在无需存储先验数据的情况下实现更好的适应效果。

摘要:

适应大语言模型到新领域会导致遗忘,因为标准方法(如全微调、LoRA)向权重空间注入新方向。我们证明遗忘由一个代数性质决定:更新是否保持预训练权重矩阵的列空间(命题1)。我们提出GAIN,最简单的乘法替代方法(W_new = S * W),通过构造满足这一性质,并可融入现有权重以实现零推理成本。在五种模型(774M至70B)依次适应八个领域的情况下,GAIN将早期领域困惑度提升7-13%,而LoRA下降18-36%。GAIN在不存储先前数据的情况下匹配增强的LoRA,并在遗忘-适应帕累托前沿上优于EWC。虽然LoRA只能通过牺牲领域适应性来减少遗忘,GAIN在无领域边界和无正则化的情况下实现两者。该原理可推广:(IA)^3,一种独立的乘法方法,也提升了早期领域。

英文摘要:

Adapting LLMs to new domains causes forgetting because standard methods (e.g., full fine-tuning, LoRA) inject new directions into the weight space. We show that forgetting is governed by one algebraic property: whether the update preserves the column span of the pretrained weight matrix (Proposition 1). We propose GAIN, the simplest multiplicative alternative (W_new = S * W), which satisfies this by construction and can be absorbed into existing weights for zero inference cost. Across five models (774M to 70B) adapted sequentially over eight domains, GAIN improves earlier-domain perplexity by 7-13%, while LoRA degrades it by 18-36%. GAIN matches replay-augmented LoRA without storing prior data and dominates EWC on the forgetting-adaptation Pareto front. While LoRA can only reduce forgetting by sacrificing in-domain adaptation, GAIN achieves both with no domain boundaries and no regularization. The principle generalises: (IA)^3, an independent multiplicative method, also improves earlier domains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑