arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.12016cs.CRcs.AIcs.LG
收藏

基于基线剪枝的神经网络木马检测方法

Baseline Pruning-Based Approach to Trojan Detection in Neural Networks

Information Technology Laboratory(信息技术实验室);National Institute of Standards and Technology(美国国家标准与技术研究院)

Peter Bajcsy, Michael Majurski

摘要:

通过系统地分析剪枝后的神经网络模型,研究了神经网络中木马的检测问题。我们基于修剪的方法包括三个主要步骤。首先,检测与模型文件大小和模型图的参考查找表的任何偏差。接下来,测量一组遵循多个修剪模式的系统修剪NN模型的准确性。最后,通过应用准确度测量和NN模型标签之间的映射,将NN模型分类为干净或中毒。这项工作概述了一个理论和实验框架,找到最佳的映射在一个大的搜索空间的修剪参数。基于我们使用Round 1和Round 2 TrojAI Challenge数据集的实验,该方法分别实现了69.73%和82.41%的平均分类准确率,每个模型的平均处理时间小于60 s。对于这两个数据集,随机猜测将产生50%的分类准确率。参考模型图和源代码可从GitHub获得。

英文摘要:

This paper addresses the problem of detecting trojans in neural networks (NNs) by analyzing systematically pruned NN models. Our pruning-based approach consists of three main steps. First, detect any deviations from the reference look-up tables of model file sizes and model graphs. Next, measure the accuracy of a set of systematically pruned NN models following multiple pruning schemas. Finally, classify a NN model as clean or poisoned by applying a mapping between accuracy measurements and NN model labels. This work outlines a theoretical and experimental framework for finding the optimal mapping over a large search space of pruning parameters. Based on our experiments using Round 1 and Round 2 TrojAI Challenge datasets, the approach achieves average classification accuracy of 69.73 % and 82.41% respectively with an average processing time of less than 60 s per model. For both datasets random guessing would produce 50% classification accuracy. Reference model graphs and source code are available from GitHub.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑