mlsanityData to 14 Oct 2026

S2AP: Score-space Sharpness Minimization for Adversarial Pruning

arXiv 2510.18381 ↗First posted 21 Oct 2025cs.CV cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Adversarial pruning methods have emerged as a powerful tool for compressing neural networks while preserving robustness against adversarial attacks. These methods typically follow a three-step pipeline: (i) pretrain a robust model, (ii) select a binary mask for weight pruning, and (iii) finetune the pruned model. To select the binary mask, these methods minimize a robust loss by assigning an importance score to each weight, and then keep the weights with the highest scores. However, this score-space optimization can lead to sharp local minima in the robust loss landscape and, in turn, to an unstable mask selection, reducing the robustness of adversarial pruning methods. To overcome this issue, we propose a novel plug-in method for adversarial pruning, termed Score-space Sharpness-aware Adversarial Pruning (S2AP). Through our method, we introduce the concept of score-space sharpness minimization, which operates during the mask search by perturbing importance scores and minimizing the corresponding robust loss. Extensive experiments across various datasets, models, and sparsity levels demonstrate that S2AP effectively minimizes sharpness in score space, stabilizing the mask selection, and ultimately improving the robustness of adversarial pruning methods.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 34 references that are in the map. First posted on arXiv 21 Oct 2025.

Builds on

26 of 34 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  4. 2013Intriguing properties of neural networkscited by 5,155
  5. 2016Wide Residual Networkscited by 3,070
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  8. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  9. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  10. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  11. 2017Evasion Attacks against Machine Learning at Test Timecited by 689
  12. 2020What is the State of Neural Network Pruning?cited by 583
14 more
  1. 2017Sharp Minima Can Generalize For Deep Netscited by 466
  2. 2017Three Factors Influencing Minima in SGDcited by 273
  3. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 237
  4. 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 92
  5. 2021Relating Adversarially Robust Generalization to Flat Minimacited by 57
  6. 2022On the Maximum Hessian Eigenvalue and Generalizationcited by 57
  7. 2021Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networkscited by 29
  8. 2024On the Duality Between Sharpness-Aware Minimization and Adversarial Trainingcited by 24
  9. 2019Towards Compact and Robust Deep Neural Networkscited by 23
  10. 2022Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Modelscited by 20
  11. 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networkscited by 17
  12. 2024Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustnesscited by 10
  13. 2024Holistic Adversarially Robust Pruningcited by 5
  14. 2025SAFE: Finding Sparse and Flat Minima to Improve Pruningcited by 5

Built on by

Not cited yet.