Non-Uniform Adversarially Robust Pruning
Abstract
Neural networks often are highly redundant and can thus be effectively compressed to a fraction of their initial size using model pruning techniques without harming the overall prediction accuracy. Additionally, pruned networks need to maintain robustness against attacks such as adversarial examples. Recent research on combining all these objectives has shown significant advances using uniform compression strategies, that is, all weights or channels are compressed equally according to a preset compression ratio. In this paper, we show that employing non-uniform compression strategies allows to significantly improve clean data accuracy as well as adversarial robustness under high overall compression. We leverage reinforcement learning for finding an optimal trade-off and demonstrate that the resulting compression strategy can be used as a plug-in replacement for uniform compression ratios of existing state-of-the-art approaches.
Cite
Text
Zhao et al. "Non-Uniform Adversarially Robust Pruning." Proceedings of the First International Conference on Automated Machine Learning, 2022.Markdown
[Zhao et al. "Non-Uniform Adversarially Robust Pruning." Proceedings of the First International Conference on Automated Machine Learning, 2022.](https://mlanthology.org/automl/2022/zhao2022automl-nonuniform/)BibTeX
@inproceedings{zhao2022automl-nonuniform,
title = {{Non-Uniform Adversarially Robust Pruning}},
author = {Zhao, Qi and Königl, Tim and Wressnegger, Christian},
booktitle = {Proceedings of the First International Conference on Automated Machine Learning},
year = {2022},
pages = {1/1-16},
volume = {188},
url = {https://mlanthology.org/automl/2022/zhao2022automl-nonuniform/}
}