用多个智能体实现无需重训练的高效模型信息删除。
Agents Are All You Need for LLM Unlearning
- 设计多智能体协同框架,分步完成无权重更新的删除任务。
- 支持上千个目标实时删除,时间开销基本不变。
- 适合需要灵活、安全删除敏感信息的场景。
大语言模型中的信息移除或抑制是实现AI合规、隐私保护与安全的重要功能。现有方法难以在删除效果与模型可用性之间取得平衡,且多数依赖模型权重访问,计算成本高。本文提出首个基于智能体的推理时大模型删减方法(ALU),采用多智能体协作、无需重训练、模型无关的设计,在不修改底层模型的前提下,通过多个专用智能体分步完成信息删除。用户可任意顺序请求删除任意内容,系统即时响应。在TOFU、WMDP、WPU等基准及越狱攻击测试中,ALU表现最优;尤其在高达1000个删除目标的规模化评估中,仍保持稳定性能,显著优于此前所有方法。
原文摘要 · Abstract (English)
Information removal or suppression in large language models (LLMs) is a desired functionality, useful in AI regulation, legal compliance, safety, and privacy. LLM unlearning methods aim to remove information on demand from LLMs. Current LLM unlearning methods struggle to balance the unlearning efficacy and utility due to the competing nature of these objectives. Keeping the unlearning process computationally feasible without assuming access to the model weights is an overlooked area. In this work we show that \textit{agents might be all we need for effective and practical inference-time LLM unlearning}. We present the first agentic LLM unlearning (\texttt{ALU}) method, a multi-agent, retrain-free, model-agnostic approach to LLM unlearning that achieves effective unlearning while preserving the utility. Our \texttt{ALU} framework unlearns by involving multiple LLM agents, each designed for a specific step in the unlearning process, without the need to update model weights for any of the agents in the framework. Users can easily request any set of unlearning instances in any sequence, and \texttt{ALU} seamlessly adapts in real time. This is facilitated without requiring any changes in the underlying LLM model. Through extensive experiments on established benchmarks (TOFU, WMDP, WPU) and jailbreaking techniques (many shot, target masking, other languages), we demonstrate that \texttt{ALU} consistently stands out as the most robust inference-time LLM unlearning framework among current state-of-the-art methods while incurring time cost that remains effectively constant regardless of the number of unlearning targets. We further highlight \texttt{ALU}'s superior performance compared to existing methods when evaluated at scale. Specifically, \texttt{ALU} is assessed on up to 1000 unlearning targets, exceeding the evaluation scope of all previously proposed LLM unlearning methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。