通过优化嵌入空间,生成能绕过安全限制的自然文本后缀。
RAID: Refusal-Aware and Integrated Decoding for Jailbreaking LLMs
- 将令牌连续化为嵌入向量,联合优化诱导受限输出
- 在少于10次查询下实现高于基线的攻击成功率
- 适合研究大模型安全漏洞与防御机制的学者
大型语言模型在多种任务中表现优异,但仍易受越狱攻击影响,导致安全机制失效。本文提出RAID(拒绝感知与集成解码框架),通过生成对抗性后缀,在保持语言流畅性的同时诱导模型产生受限内容。该方法将离散令牌松弛为连续嵌入,采用联合目标函数:(i) 鼓励生成受限响应,(ii) 引入拒绝感知正则项,使嵌入激活远离拒绝方向,(iii) 加入连贯性项以维持语义合理性与非冗余性。优化后,通过批判者引导的解码过程,将嵌入映射回令牌,平衡嵌入亲和度与语言模型似然。实验表明,RAID在多个开源LLM上以更少查询次数、更低计算成本,取得比近期白盒与黑盒基线更高的攻击成功率。结果凸显嵌入空间正则化对理解与缓解越狱漏洞的重要性。
原文摘要 · Abstract (English)
Large language models (LLMs) achieve impressive performance across diverse tasks yet remain vulnerable to jailbreak attacks that bypass safety mechanisms. We present RAID (Refusal-Aware and Integrated Decoding), a framework that systematically probes these weaknesses by crafting adversarial suffixes that induce restricted content while preserving fluency. RAID relaxes discrete tokens into continuous embeddings and optimizes them with a joint objective that (i) encourages restricted responses, (ii) incorporates a refusal-aware regularizer to steer activations away from refusal directions in embedding space, and (iii) applies a coherence term to maintain semantic plausibility and non-redundancy. After optimization, a critic-guided decoding procedure maps embeddings back to tokens by balancing embedding affinity with language-model likelihood. This integration yields suffixes that are both effective in bypassing defenses and natural in form. Experiments on multiple open-source LLMs show that RAID achieves higher attack success rates with fewer queries and lower computational cost than recent white-box and black-box baselines. These findings highlight the importance of embedding-space regularization for understanding and mitigating LLM jailbreak vulnerabilities.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。