提出首个统一攻击框架,破解大模型合并中的隐蔽威胁
RogueMerge: Robust and Unified Attacks against LLM Model Merging

- 用联合优化替代静态拼接,应对生成式模型的逐词误差累积
- 通过元学习模拟未知配置,在170多个合并模型中保持攻击成功率
- 支持多种攻击类型且抗防御,适合研究安全与对抗性合并的学者
模型合并通过整合来自不可信平台的任务向量,将专用能力融合进单一大模型,但暴露了关键供应链攻击面:恶意行为可编码于任务向量,合并过程使第三方向量直接写入模型权重。现有工作仅针对分类器的后门攻击,使用静态算术启发式,难以有效应对生成式LLM的多样化攻击,原因有三:(i) LLM依赖自回归解码,合并引入的微小参数漂移在生成过程中逐词累积,快速恶化攻击效果;(ii) 攻击者不了解目标合并配置,孤立优化的静态向量易被稀释或破坏;(iii) 实际威胁需泛化至未见过的攻击提示,静态向量无法充分编码。本文提出RogueMerge,首个系统性统一框架,解决上述三重挑战:为应对自回归生成,以联合优化取代静态算术,显式保证合并后的攻击成功;为应对未知合并设置,将攻击注入建模为随机极小极大问题,并通过类元学习模拟求解;为跨异构攻击提示泛化,采用分布鲁棒优化,推导出适用于大模型规模的一阶泰勒近似,并给出可证明误差界。在四种威胁、六种合并算法和超过170个合并的LLM上,RogueMerge持续优于现有攻击方法,且在多种合并设置下保持稳定,能抵抗主流防御手段。
原文摘要 · Abstract (English)
Model merging composes specialized capabilities into a single LLM by aggregating task vectors sourced from unverified public platforms, exposing a critical supply-chain attack surface: Because any malicious behavior can be encoded into a task vector, and merging grants third-party vectors direct write access to model weights, an attacker-provided task vector can enable or amplify diverse downstream threats. Prior work studies only backdoor attacks against model merging for classifiers using static arithmetic heuristics, which fail to effectively handle diverse attacks on generative LLMs for three reasons. (i) LLMs rely on autoregressive decoding, where the minor parameter drift introduced by merging compounds across tokens and rapidly degrades the attack. (ii) Attackers have no knowledge of the victim's merging configurations, causing a static attack vector optimized in isolation to be easily diluted or destroyed. (iii) Practical threat induction must generalize to attack prompts unseen during optimization, which static vectors cannot adequately encode. We present RogueMerge, the first principled, unified framework that addresses all three challenges. To handle autoregressive generation, we replace static arithmetic with a joint optimization that explicitly enforces attack success after merging. To handle unknown merging settings, we formulate attack injection as a stochastic min-max problem and solve it via meta-learning-style simulation. To generalize across heterogeneous attack prompts, we employ distributionally robust optimization and derive a tractable first-order Taylor approximation at LLM scale, with a provable error bound. Across four threats, six merging algorithms, and over 170 merged LLMs, RogueMerge consistently outperforms existing attacks. It also remains stable across diverse merging settings and resists standard defenses.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。