用强化学习选关键层,实现隐蔽高效的联邦学习后门攻击
POLAR: Policy-based Layerwise Reinforcement Learning Method for Stealthy Backdoor Attacks in Federated Learning
- 基于策略的强化学习动态选择攻击层,避免人工规则
- 在六种先进防御下,攻击成功率比最新方法高40%
- 通过惩罚大范围修改提升隐蔽性,适合研究防御机制者
联邦学习(FL)在不暴露本地数据的前提下实现跨客户端的分布式模型训练,但其分布式特性使其易受后门攻击。早期攻击需修改整个模型,而近期研究提出仅毒化关键(BC)层以兼顾隐蔽性与有效性。然而现有方法依赖固定规则选择层,忽略层间关联,导致效果差且易被检测。本文提出POLAR(POlicy-based LAyerwise Reinforcement learning),首个将强化学习用于层级后门攻击中关键层选择的方法。POLAR采用轻量化的伯努利采样,通过策略梯度更新动态优化层选择策略,依据后门成功率(BSR)提升进行决策。为保障隐蔽性,引入正则化约束,惩罚大范围修改的攻击行为。大量实验表明,POLAR在对抗六种最先进的(SOTA)防御时,攻击成功率相较最新方法最高提升40%。
原文摘要 · Abstract (English)
Federated Learning (FL) enables decentralized model training across multiple clients without exposing local data, but its distributed feature makes it vulnerable to backdoor attacks. Despite early FL backdoor attacks modifying entire models, recent studies have explored the concept of backdoor-critical (BC) layers, which poison the chosen influential layers to maintain stealthiness while achieving high effectiveness. However, existing BC layers approaches rely on rule-based selection without consideration of the interrelations between layers, making them ineffective and prone to detection by advanced defenses. In this paper, we propose POLAR (POlicy-based LAyerwise Reinforcement learning), the first pipeline to creatively adopt RL to solve the BC layer selection problem in layer-wise backdoor attack. Different from other commonly used RL paradigm, POLAR is lightweight with Bernoulli sampling. POLAR dynamically learns an attack strategy, optimizing layer selection using policy gradient updates based on backdoor success rate (BSR) improvements. To ensure stealthiness, we introduce a regularization constraint that limits the number of modified layers by penalizing large attack footprints. Extensive experiments demonstrate that POLAR outperforms the latest attack methods by up to 40% against six state-of-the-art (SOTA) defenses.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。