arXiv:2605.08765cs.LGcs.AI2026-05ACL

提出评估大模型删忆诚实性的方法,发现现有技术多会胡说,新方法显著提升拒答率与诚实性。

Unlearners Can Lie: Evaluating and Improving Honesty in LLM Unlearning

论文配图:Unlearners Can Lie: Evaluating and Improving Honesty in LLM Unlearning
图 1 · 摘自论文原文
  • 定义删忆诚实性:保留知识时需真实可信,遗忘知识时应明确拒绝
  • 9种方法均不达标,新方法ReVa在问答中拒答率近乎翻倍
  • 适合关注AI安全、可解释性的研究者与工程师

大语言模型的删忆旨在移除有害训练数据的同时保持整体性能。然而我们发现,现有方法常产生幻觉、异常标记序列或行为不一致,引发安全与信任担忧。根据大模型诚实性相关文献,此类表现通常关联于不诚实。为此,我们提出删忆诚实性的形式化定义:(1) 保留知识时兼顾性能与诚实性;(2) 有效遗忘并鼓励模型承认自身局限,在涉及遗忘内容的问题上保持一致回应。为系统评估删忆诚实性,我们设计一套涵盖性能、保留集诚实性、遗忘有效性、拒答率及拒答稳定性的指标。在3类主流方法中评估9种方案,结果均未达标。经实验与理论分析,提出ReVa——一种特征对齐微调方法,通过随机化特征后调整已删忆模型以更好承认遗忘内容。在来自遗忘数据集的问答任务中,ReVa经两轮交互后拒答率最高,接近次优方法的两倍;同时显著提升保留集上的诚实性。代码与数据已开源。

原文摘要 · Abstract (English)

Unlearning in large language models (LLMs) aims to remove harmful training data while preserving overall utility. However, we find that existing methods often hallucinate, generate abnormal token sequences, or behave inconsistently, raising safety and trust concerns. According to prior literature on LLM honesty, such behaviors are often associated with dishonesty. This motivates us to investigate the notion of honesty in the context of model unlearning. We propose a formal definition of unlearning honesty, which includes: (1) preserving both utility and honesty on retained knowledge, and (2) ensuring effective forgetting while encouraging the model to acknowledge its limitations and respond consistently to questions related to forgotten knowledge. To systematically evaluate the honesty of unlearning, we introduce a suite of metrics that cover utility, honesty on the retained set, effectiveness of forgetting, rejection rate and refusal stability in Q&A and MCQ settings. Evaluating 9 methods across 3 mainstream families shows that all current methods fail to meet these standards. After experimental and theoretical analyses, we present ReVa, a representation-alignment procedure that fine-tunes feature-randomized unlearned models to better acknowledge forgotten knowledge. On Q&A tasks from the forget set, ReVa achieves the highest rejection rate after two rounds of interaction, nearly doubling the performance of the second-best method. Remarkably, It also improves honesty on the retained set. We release our data and code at https://github.com/renjiegu.

大模型删忆诚实性安全

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。