Baseline Pruning-Based Approach to Trojan Detection in Neural Networks

• URL: http://arxiv.org/abs/2101.12016v2
• Date: Tue, 9 Feb 2021 14:58:21 GMT
• Title: Baseline Pruning-Based Approach to Trojan Detection in Neural Networks
• Abstract summary: 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.
• Score: 3.6187615899782415
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: 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.

Related papers

• How the Graph Construction Technique Shapes Performance in IoT Botnet Detection [2.2940141855172036]
  This study evaluates how the choice of the method for constructing the graph-structured dataset impacts the classification performance of a GNN model.<n>Five methods--k-Nearest Neighbors, Mutual Nearest Neighbors, Shared Nearest Neighbor, Gabriel Graph, and epsilon-radius Graph--were evaluated.<n>Using Gabriel graph achieves the highest detection performance with an accuracy of 97.56% while SNN recorded the lowest performance with an accuracy as low as 78.56%.
  arXiv  Detail & Related papers  (2026-02-28T11:29:19Z)
• Pruning and Quantization Impact on Graph Neural Networks [3.3262657112288196]
  Graph neural networks (GNNs) operate with high accuracy on learning from graph-structured data.<n>Two of the common neural network compression techniques include pruning and quantization.<n>We empirically examine the effects of three pruning methods and three quantization methods on different GNN models.
  arXiv  Detail & Related papers  (2025-10-24T22:44:25Z)
• Fast and Accurate Identification of Hardware Trojan Locations in Gate-Level Netlist using Nearest Neighbour Approach integrated with Machine Learning Technique [0.0]
  This research proposes an innovative machine learning-based methodology for identifying malicious logic gates in gate-level netlists. Case I utilizes a decision tree algorithm for node-to-node comparisons, significantly improving detection accuracy. Case II introduces a graph-to-graph classification using a Graph Neural Network (GNN) model, enabling the differentiation between normal and Trojan-infected circuit designs. Case III applies GNN-based node classification to identify individual compromised nodes and its location.
  arXiv  Detail & Related papers  (2025-01-18T10:15:16Z)
• Ensemble Quadratic Assignment Network for Graph Matching [52.20001802006391]
  Graph matching is a commonly used technique in computer vision and pattern recognition. Recent data-driven approaches have improved the graph matching accuracy remarkably. We propose a graph neural network (GNN) based approach to combine the advantages of data-driven and traditional methods.
  arXiv  Detail & Related papers  (2024-03-11T06:34:05Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• An Efficient End-to-End Deep Neural Network for Interstitial Lung Disease Recognition and Classification [0.5424799109837065]
  This paper introduces an end-to-end deep convolution neural network (CNN) for classifying ILDs patterns. The proposed model comprises four convolutional layers with different kernel sizes and Rectified Linear Unit (ReLU) activation function. A dataset consisting of 21328 image patches of 128 CT scans with five classes is taken to train and assess the proposed model.
  arXiv  Detail & Related papers  (2022-04-21T06:36:10Z)
• RGP: Neural Network Pruning through Its Regular Graph Structure [6.0686251332936365]
  We study the graph structure of the neural network, and propose regular graph based pruning (RGP) to perform a one-shot neural network pruning. Experiments show that the average shortest path length of the graph is negatively correlated with the classification accuracy of the corresponding neural network.
  arXiv  Detail & Related papers  (2021-10-28T15:08:32Z)
• Effective Model Sparsification by Scheduled Grow-and-Prune Methods [73.03533268740605]
  We propose a novel scheduled grow-and-prune (GaP) methodology without pre-training the dense models. Experiments have shown that such models can match or beat the quality of highly optimized dense models at 80% sparsity on a variety of tasks.
  arXiv  Detail & Related papers  (2021-06-18T01:03:13Z)
• ANNETTE: Accurate Neural Network Execution Time Estimation with Stacked Models [56.21470608621633]
  We propose a time estimation framework to decouple the architectural search from the target hardware. The proposed methodology extracts a set of models from micro- kernel and multi-layer benchmarks and generates a stacked model for mapping and network execution time estimation. We compare estimation accuracy and fidelity of the generated mixed models, statistical models with the roofline model, and a refined roofline model for evaluation.
  arXiv  Detail & Related papers  (2021-05-07T11:39:05Z)
• Exploiting Adam-like Optimization Algorithms to Improve the Performance of Convolutional Neural Networks [82.61182037130405]
  gradient descent (SGD) is the main approach for training deep networks. In this work, we compare Adam based variants based on the difference between the present and the past gradients. We have tested ensemble of networks and the fusion with ResNet50 trained with gradient descent.
  arXiv  Detail & Related papers  (2021-03-26T18:55:08Z)
• Exploring the Uncertainty Properties of Neural Networks' Implicit Priors in the Infinite-Width Limit [47.324627920761685]
  We use recent theoretical advances that characterize the function-space prior to an ensemble of infinitely-wide NNs as a Gaussian process. This gives us a better understanding of the implicit prior NNs place on function space. We also examine the calibration of previous approaches to classification with the NNGP.
  arXiv  Detail & Related papers  (2020-10-14T18:41:54Z)
• Learning All Credible Bayesian Network Structures for Model Averaging [3.81379858342235]
  We propose a novel approach to model averaging inspired by performance guarantees in approximation algorithms. Our approach is more efficient and scales to significantly larger Bayesian networks than existing approaches.
  arXiv  Detail & Related papers  (2020-08-27T19:56:27Z)
• EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruning [82.54669314604097]
  EagleEye is a simple yet efficient evaluation component based on adaptive batch normalization. It unveils a strong correlation between different pruned structures and their final settled accuracy. This module is also general to plug-in and improve some existing pruning algorithms.
  arXiv  Detail & Related papers  (2020-07-06T01:32:31Z)
• Question Type Classification Methods Comparison [0.0]
  The paper presents a comparative study of state-of-the-art approaches for question classification task: Logistic Regression, Convolutional Neural Networks (CNN), Long Short-Term Memory Network (LSTM) and Quasi-Recurrent Neural Networks (QRNN) All models use pre-trained GLoVe word embeddings and trained on human-labeled data. The best accuracy is achieved using CNN model with five convolutional layers and various kernel sizes stacked in parallel, followed by one fully connected layer.
  arXiv  Detail & Related papers  (2020-01-03T00:16:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.