mlsanityData to 14 Oct 2026

Towards Compact and Robust DNNs via Compression-aware Sharpness Minimization

arXiv 2601.20301 ↗First posted 28 Jan 2026cs.CV cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Sharpness-Aware Minimization (SAM) has recently emerged as an effective technique for improving DNN robustness to input variations. However, its interplay with the compactness requirements of on-device DNN deployments remains less explored. Simply pruning a SAM-trained model can undermine robustness, since flatness in the continuous parameter space does not necessarily translate to robustness under the discrete structural changes induced by pruning. Conversely, applying SAM after pruning may be fundamentally constrained by architectural limitations imposed by an early, robustness-agnostic pruning pattern. To address this gap, we propose Compression-aware ShArpness Minimization (C-SAM), a framework that shifts sharpness-aware learning from parameter perturbations to mask perturbations. By explicitly perturbing pruning masks during training, C-SAM promotes a flatter loss landscape with respect to model structure, enabling the discovery of pruning patterns that simultaneously optimize model compactness and robustness to input variations. Extensive experiments on CelebA-HQ, Flowers-102, and CIFAR-10-C across ResNet-18, GoogLeNet, and MobileNet-V2 show that C-SAM consistently achieves higher certified robustness than strong baselines, with improvements of up to 42%, while maintaining task accuracy comparable to the corresponding unpruned models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 49 of its 62 references that are in the map. First posted on arXiv 28 Jan 2026.

Builds on

49 of 62 references.

References · 49

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  4. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  5. 2014Going Deeper with Convolutionscited by 4,241
  6. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
  7. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  9. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  11. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  12. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
37 more
  1. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  2. 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
  3. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  4. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  5. 2021DiffusionCLIP: Text-Guided Diffusion Models for Robust Image Manipulationcited by 642
  6. 2019MaskGAN: Towards Diverse and Interactive Facial Image Manipulationcited by 628
  7. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  8. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  9. 2021Diffusion Autoencoders: Toward a Meaningful and Decodable Representationcited by 449
  10. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
  11. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  12. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  13. 2023DepGraph: Towards Any Structural Pruningcited by 203
  14. 2018Stochastic Activation Pruning for Robust Adversarial Defensecited by 171
  15. 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
  16. 2021Group Fisher Pruning for Practical Network Compressioncited by 131
  17. 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
  18. 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
  19. 2019Model Compression with Adversarial Robustness: A Unified Optimization Frameworkcited by 71
  20. 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
  21. 2022Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approachcited by 70
  22. 2021A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustnesscited by 62
  23. 2024Friendly Sharpness-Aware Minimizationcited by 53
  24. 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Trainingcited by 41
  25. 2023OTOV2: Automatic, Generic, User-Friendlycited by 32
  26. 2025Explicit Eigenvalue Regularization Improves Sharpness-Aware Minimizationcited by 21
  27. 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
  28. 2020Robustness Certification of Generative Modelscited by 19
  29. 2021CC-Cert: A Probabilistic Approach to Certify General Robustness of Neural Networkscited by 19
  30. 2022Unrestricted Black-box Adversarial Attack Using GAN with Limited Queriescited by 18
  31. 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 18
  32. 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networkscited by 17
  33. 2018To compress or not to compress: Understanding the Interactions between Adversarial Attacks and Neural Network Compressioncited by 14
  34. 2022Can pruning improve certified robustness of neural networks?cited by 14
  35. 2023Precise and Generalized Robustness Certification for Neural Networkscited by 4
  36. 2023Systematic Investigation of Sparse Perturbed Sharpness-Aware Minimization Optimizercited by 4
  37. 2024HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruningcited by 4

Built on by

Not cited yet.