arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.03097cs.LGcs.AIcs.CL
收藏

每个(文本序列)各有其道:改进大语言模型中的已记忆数据遗忘

To Each (Textual Sequence) Its Own: Improving Memorized-Data Unlearning in Large Language Models

University of Warwick(华威大学)

George-Octavian Barbulescu, Peter Triantafillou

AI总结:

本文提出按文本序列在LLM中的记忆程度差异化遗忘的新视角,贡献新评估指标、对抗攻击及两种遗忘方法,并通过大规模实验验证其效果。

摘要:

大语言模型(LLMs)已被发现会记忆训练文本序列,并在文本生成期间逐字复述这些序列。这一事实被认为是隐私及相关(如版权)问题的根源。因此,LLMs 中的遗忘(Unlearning)表现为设计新算法,以妥善处理这些已记忆数据的副作用,同时不损害模型的实用性。我们为实现这一目标提供了一个新视角,即每个待遗忘的文本序列在遗忘时应根据其在 LLM 内的记忆程度被区别对待。我们贡献了一种衡量遗忘质量的新指标,一种对抗攻击,表明缺乏这一视角的 SOTA 算法在隐私方面失效,以及两种分别基于梯度上升(Gradient Ascent)和任务算术(Task Arithmetic)的新遗忘方法。随后,在一系列广泛的 NLP 任务上进行的综合性能评估绘制了解空间,识别了在不同模型容量规模和遗忘集大小下的最佳方案,并量化了新方法的收益。

英文摘要:

LLMs have been found to memorize training textual sequences and regurgitate verbatim said sequences during text generation time. This fact is known to be the cause of privacy and related (e.g., copyright) problems. Unlearning in LLMs then takes the form of devising new algorithms that will properly deal with these side-effects of memorized data, while not hurting the model's utility. We offer a fresh perspective towards this goal, namely, that each textual sequence to be forgotten should be treated differently when being unlearned based on its degree of memorization within the LLM. We contribute a new metric for measuring unlearning quality, an adversarial attack showing that SOTA algorithms lacking this perspective fail for privacy, and two new unlearning methods based on Gradient Ascent and Task Arithmetic, respectively. A comprehensive performance evaluation across an extensive suite of NLP tasks then mapped the solution space, identifying the best solutions under different scales in model capacities and forget set sizes and quantified the gains of the new approaches.

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

↑