Resistance to Fast Gradient Sign Method Using Block Switching Algorithm
Bibliographic record
Abstract
Traditional ways of protecting against the "Fast Gradient Sign Method" attack usually involve methods like altering the input data before processing, training systems to recognize harmful inputs, or identifying harmful inputs directly. However, these traditional methods have a number of shortcomings, including their limited success, vulnerability to more advanced attacks, difficulty in understanding how they work, and too much dependence on standard sets of data for testing. By creating a strong protective, the system against The Fast gradient Sign Technique, the objective of this study is to enhance the resilience of machine learning algorithms against adversarial attacks while improving their safety and dependability in the highest level of accuracy and performance. The study is guided by three objectives: to investigate the robustness of existing Deep Learning algorithms for defense against the Fast Gradient Sign Method; to implement the block-switching algorithm for defending against the Fast Gradient Sign Method; and to evaluate the performance metric of the block-switching algorithm for the protection of deep learning models against adversarial attacks. The study will consider three theories that underpin the block-switching algorithm including: Avalanche effect, Cryptographic Strength, and Probability theory. The research will use datasets from the Modified National Institute of Standards and Technology and the Canadian Institute for Advanced Research. It will select commonly used deep learning models for image classification, such as Residual Neural Network, Visual Geometry Groups, or Inception, for analysis. The study will employ the Fast Gradient Sign Method to create adversarial examples for each model within the chosen datasets. The researcher will then compare each Deep Learning model's performance on the adversarial dataset with the original dataset to see how resilient each one is against first gradient sign adversarial assaults. To evaluate these criteria including accuracy, precision, recall, and F1 score will be applied. The research will perform a sensitivity analysis on the parameters used in the Fast Gradient Sign Method attack generation to investigate how the attack strength and the number of iterations affect the model's robustness against adversarial attacks. To perform the sensitivity analysis, the researcher will use Python and a set of test data in the Tensor Flow library.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".