用进化算法生成更隐蔽、更有效的通用干扰噪声,提升攻击成功率。
Towards Robust Universal Perturbation Attacks: A Float-Coded, Penalty-Driven Evolutionary Approach
- 采用浮点编码与动态演化策略,无需梯度即可生成扰动。
- 在ImageNet上扰动范数更小,误分类率更高,收敛更快。
- 适合研究对抗攻击或提升模型鲁棒性的研究人员使用。
通用对抗扰动(UAP)因其能用单一噪声模式干扰多个输入而受到广泛关注。进化算法因其可在非凸、无梯度的复杂空间中搜索的特性,成为生成此类扰动的有力工具。本文提出一种浮点编码、惩罚驱动的单目标进化框架,可生成可见性更低、攻击成功率更高的通用扰动。该方法采用连续基因表示,适配现代深度学习规模;引入动态演化算子与自适应调度机制,并基于模块化PyTorch实现,便于与主流架构无缝集成。通过跨多种模型测试及周期性更换批量数据,确保扰动的通用性。在ImageNet上的实验表明,本方法生成的扰动范数更小、误分类效果更强、收敛速度更快,优于现有基于进化的方法。结果验证了该框架在多种深度学习架构上的鲁棒性与可扩展性。
原文摘要 · Abstract (English)
Universal adversarial perturbations (UAPs) have garnered significant attention due to their ability to undermine deep neural networks across multiple inputs using a single noise pattern. Evolutionary algorithms offer a promising approach to generating such perturbations due to their ability to navigate non-convex, gradient-free landscapes. In this work, we introduce a float-coded, penalty-driven single-objective evolutionary framework for UAP generation that achieves lower visibility perturbations while enhancing attack success rates. Our approach leverages continuous gene representations aligned with contemporary deep learning scales, incorporates dynamic evolutionary operators with adaptive scheduling, and utilizes a modular PyTorch implementation for seamless integration with modern architectures. Additionally, we ensure the universality of the generated perturbations by testing across diverse models and by periodically switching batches to prevent overfitting. Experimental results on the ImageNet dataset demonstrate that our framework consistently produces perturbations with smaller norms, higher misclassification effectiveness, and faster convergence compared to existing evolutionary-based methods. These findings highlight the robustness and scalability of our approach for universal adversarial attacks across various deep learning architectures.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。