Boosting Adversarial Attack Transferability via Random Block Shuffle

Hanwen Liu, Bingrong Xu, Yin Sheng, Zhigang Zeng
{"title":"Boosting Adversarial Attack Transferability via Random Block Shuffle","authors":"Hanwen Liu, Bingrong Xu, Yin Sheng, Zhigang Zeng","doi":"10.1109/icaci55529.2022.9837674","DOIUrl":null,"url":null,"abstract":"An interesting property of deep convolutional neural networks is their weakness to adversarial examples, which can deceive the models with subtle perturbations. Though adversarial attack algorithms have accomplished excellent performance in the white-box scenario, they frequently display a low attack success rate in the black-box scenario. Various transformation-based attack methods are shown to be powerful to enhance the transferability of adversarial examples. In this work, several novel transformation-based attack methods that integrate with the Random Block Shuffle (RBS) and Ensemble Random Block Shuffle (ERBS) mechanisms are come up with to boost adversarial transferability. First of all, the RBS calculates the gradient of the shuffled input instead of the original input. It increases the diversity of adversarial perturbation’s gradient and makes the original input’s information more invisible for the model. Based on the RBS, the ERBS is proposed to decrease gradient variance and stabilize the update direction further, which integrates the gradient of transformed inputs. Moreover, by incorporating various gradient-based attack methods with transformation-based methods, the adversarial transferability could be additionally improved fundamentally and relieve the overfitting problem. Our best attack method arrives an average success rate of 85.5% on two normally trained models and two adversarially trained models, which outperforms existing baselines.","PeriodicalId":412347,"journal":{"name":"2022 14th International Conference on Advanced Computational Intelligence (ICACI)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 14th International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icaci55529.2022.9837674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An interesting property of deep convolutional neural networks is their weakness to adversarial examples, which can deceive the models with subtle perturbations. Though adversarial attack algorithms have accomplished excellent performance in the white-box scenario, they frequently display a low attack success rate in the black-box scenario. Various transformation-based attack methods are shown to be powerful to enhance the transferability of adversarial examples. In this work, several novel transformation-based attack methods that integrate with the Random Block Shuffle (RBS) and Ensemble Random Block Shuffle (ERBS) mechanisms are come up with to boost adversarial transferability. First of all, the RBS calculates the gradient of the shuffled input instead of the original input. It increases the diversity of adversarial perturbation’s gradient and makes the original input’s information more invisible for the model. Based on the RBS, the ERBS is proposed to decrease gradient variance and stabilize the update direction further, which integrates the gradient of transformed inputs. Moreover, by incorporating various gradient-based attack methods with transformation-based methods, the adversarial transferability could be additionally improved fundamentally and relieve the overfitting problem. Our best attack method arrives an average success rate of 85.5% on two normally trained models and two adversarially trained models, which outperforms existing baselines.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过随机分组洗牌提高对抗性攻击的可转移性
深度卷积神经网络的一个有趣的特性是它们对对抗性示例的弱点,对抗性示例可以用细微的扰动欺骗模型。尽管对抗性攻击算法在白盒场景中取得了优异的表现,但在黑盒场景中往往表现出较低的攻击成功率。各种基于转换的攻击方法被证明是强大的,以提高对抗性示例的可转移性。在这项工作中,提出了几种新的基于转换的攻击方法,这些方法集成了随机块洗牌(RBS)和集成随机块洗牌(ERBS)机制,以提高对抗可转移性。首先,RBS计算洗牌后的输入而不是原始输入的梯度。它增加了对抗扰动梯度的多样性,使原始输入信息对模型更加不可见。在此基础上,提出了ERBS算法,通过对变换后输入的梯度进行集成,进一步减小梯度方差,稳定更新方向。此外,通过将各种基于梯度的攻击方法与基于变换的方法相结合,可以从根本上提高对抗可转移性,缓解过拟合问题。我们的最佳攻击方法在两个正常训练模型和两个对抗训练模型上的平均成功率为85.5%,优于现有的基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Speed Estimation of Video Target Based on Siamese Convolutional Network and Kalman Filtering Aspect Term Extraction and Categorization for Chinese MOOC Reviews A Global Harmony Search Algorithm Based on Tent Chaos Map and Elite Reverse Learning An Improved Superpixel-based Fuzzy C-Means Method for Complex Picture Segmentation Tasks New Results on Finite-Time Synchronization of Delayed Fuzzy Neural Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1