通过最大化概率差异,精准攻击大模型并提升安全性评估能力。
Target-driven Attack for Large Language Models
- 以最小化条件概率差异为目标,构建可优化的攻击框架。
- 在多个模型和数据集上实现超过85%的成功率,显著优于随机策略。
- 适合安全研究者与模型鲁棒性评估人员使用。
当前大型语言模型(LLM)为大规模用户导向的自然语言任务提供了坚实基础。许多用户可通过用户界面轻松注入对抗性文本或指令,导致模型产生错误响应,带来安全挑战。尽管已有大量黑盒攻击研究,但多数方法依赖随机或启发式策略,其与攻击成功率的关系不明确,难以有效提升模型鲁棒性。为此,我们提出目标驱动的黑盒攻击方法,旨在最大化干净文本与攻击文本的条件概率之间的KL散度,重新定义攻击目标。将距离最大化问题转化为两个凸优化问题,求解攻击文本并估计协方差;利用投影梯度下降算法求解攻击文本对应的向量。该方法包含两种攻击策略:词元操控与误导信息攻击。在多个大型语言模型和数据集上的实验结果表明,该攻击方法具有显著有效性。
原文摘要 · Abstract (English)
Current large language models (LLM) provide a strong foundation for large-scale user-oriented natural language tasks. Many users can easily inject adversarial text or instructions through the user interface, thus causing LLM model security challenges like the language model not giving the correct answer. Although there is currently a large amount of research on black-box attacks, most of these black-box attacks use random and heuristic strategies. It is unclear how these strategies relate to the success rate of attacks and thus effectively improve model robustness. To solve this problem, we propose our target-driven black-box attack method to maximize the KL divergence between the conditional probabilities of the clean text and the attack text to redefine the attack's goal. We transform the distance maximization problem into two convex optimization problems based on the attack goal to solve the attack text and estimate the covariance. Furthermore, the projected gradient descent algorithm solves the vector corresponding to the attack text. Our target-driven black-box attack approach includes two attack strategies: token manipulation and misinformation attack. Experimental results on multiple Large Language Models and datasets demonstrate the effectiveness of our attack method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。