Adaptive Sharpness-Aware Pruning for Robust Sparse Networks
Anna Bair, Hongxu Yin, Maying Shen, Pavlo Molchanov, José M. Álvarez
Abstract
Robustness and compactness are two essential attributes of deep learning models that are deployed in the real world. The goals of robustness and compactness may seem to be at odds, since robustness requires generalization across domains, while the process of compression exploits specificity in one domain. We introduce Adaptive Sharpness-Aware Pruning (AdaSAP), which unifies these goals through the lens of network sharpness. The AdaSAP method produces sparse networks that are robust to input variations which are unseen at training time. We achieve this by strategically incorporating weight perturbations in order to optimize the loss landscape. This allows the model to be both primed for pruning and regularized for improved robustness. AdaSAP improves the robust accuracy of pruned models on image classification by up to +6% on ImageNet C and +4% on Ima-geNet V2, and on object detection by +4% on a corrupted Pascal VOC dataset, over a wide range of compression ratios, pruning criteria, and network architectures, outperforming recent pruning art by large margins.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers5
- Cut Less, Fold More: Model Compression through the Lens of Projection GeometryOlga Saukh, Dong Wang, Haris Sikic, Yun Cheng et al.ICLR 2026 · 4 citations
- Suppress and Diversify: Refining Robust Pathways for Corruption RobustnessJiangang Yang, Wenhui Shi, Xiaoran Xu, Wenyue Chong et al.ICML 2026
- Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption RobustnessBoqian Wu, Qiao Xiao, Shunxin Wang, Nicola Strisciuglio et al.ICLR 2025
- SAFE: Finding Sparse and Flat Minima to Improve PruningDongyeop Lee, Kwanhee Lee, Jinseok Chung, Namhoon LeeICML 2025
- More Experts Than Galaxies: Conditionally-Overlapping Experts with Biologically-Inspired Fixed RoutingSagi Shaier, Francisco Pereira, Katharina von der Wense, Lawrence Hunter et al.ICLR 2025
Builds on30
- SegFormer: Simple and Efficient Design for Semantic Segmentation with TransformersEnze Xie, Wenhai Wang, Zhiding Yu, Anima Anandkumar et al.NeurIPS 2021 · 9,661 citations
- Sharpness-aware Minimization for Efficiently Improving GeneralizationPierre Foret, Ariel Kleiner, Hossein Mobahi, Behnam NeyshaburICLR 2021 · 1,861 citations
- Adversarial Weight Perturbation Helps Robust GeneralizationDongxian Wu, Shu-Tao Xia, Yisen WangNeurIPS 2020 · 917 citations
- Picking Winning Tickets Before Training by Preserving Gradient FlowChaoqi Wang, Guodong Zhang, Roger B. GrosseICLR 2020 · 743 citations
- Fantastic Generalization Measures and Where to Find ThemYiding Jiang, Behnam Neyshabur, Hossein Mobahi, Dilip Krishnan et al.ICLR 2020 · 705 citations
Related papers
- CSTAR: Towards Compact and Structured Deep Neural Networks with Adversarial RobustnessHuy Phan, Miao Yin, Yang Sui, Bo Yuan et al.AAAI 2023 · 10 citations
- HYDRA: Pruning Adversarially Robust Neural NetworksVikash Sehwag, Shiqi Wang, Prateek Mittal, Suman JanaNeurIPS 2020 · 242 citations
- Holistic Adversarially Robust PruningQi Zhao, Christian WressneggerICLR 2023
- Improving robustness to corruptions with multiplicative weight perturbationsTrung Q. Trinh, Markus Heinonen, Luigi Acerbi, Samuel KaskiNeurIPS 2024 · 8 citations
- Learning Adversarially Robust Sparse Networks via Weight ReparameterizationChenhao Li, Qiang Qiu, Zhibin Zhang, Jiafeng Guo et al.AAAI 2023 · 8 citations
