Improving Adversarial Robustness for Free with Snapshot Ensemble
Not on the map. Why?
Abstract (arXiv)
Adversarial training, as one of the few certified defenses against adversarial attacks, can be quite complicated and time-consuming, while the results might not be robust enough. To address the issue of lack of robustness, ensemble methods were proposed, aiming to get the final output by weighting the selected results from repeatedly trained processes. It is proved to be very useful in achieving robust and accurate results, but the computational and memory costs are even higher. Snapshot ensemble, a new ensemble method that combines several local minima in a single training process to make the final prediction, was proposed recently, which reduces the time spent on training multiple networks and the memory to store the results. Based on the snapshot ensemble, we present a new method that is easier to implement: unlike original snapshot ensemble that seeks for local minima, our snapshot ensemble focuses on the last few iterations of a training and stores the sets of parameters from them. Our algorithm is much simpler but the results are no less accurate than the original ones: based on different hyperparameters and datasets, our snapshot ensemble has shown a 5% to 30% increase in accuracy when compared to the traditional adversarial training.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 45 of its 67 references that are in the map. First posted on arXiv 7 Oct 2021.
Builds on
45 of 67 references.
References · 45
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2016Adversarial Machine Learning at Scalecited by 934
33 more
- 2017Ensemble Adversarial Training: Attacks and Defensescited by 833
- 2016Universal adversarial perturbationscited by 774
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2021A Survey of Uncertainty in Deep Neural Networkscited by 675
- 2019Adversarial Training for Free!cited by 638
- 2015Cyclical Learning Rates for Training Neural Networkscited by 627
- 2017One pixel attack for fooling deep neural networkscited by 579
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
- 2015Variational Dropout and the Local Reparameterization Trickcited by 489
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
- 2019Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attackscited by 352
- 2017Adversarial Examples: Attacks and Defenses for Deep Learningcited by 350
- 2017Snapshot Ensembles: Train 1, get M for freecited by 349
- 2017Adversarial Attacks on Neural Network Policiescited by 314
- 2019A Fourier Perspective on Model Robustness in Computer Visioncited by 288
- 2016Learning from Simulated and Unsupervised Images through Adversarial Trainingcited by 287
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
- 2018Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionalitycited by 280
- 2017MagNet: a Two-Pronged Defense against Adversarial Examplescited by 268
- 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
- 2019Robust Learning with Jacobian Regularizationcited by 127
- 2018SparseFool: a few pixels make a big differencecited by 94
- 2018Improving DNN Robustness to Adversarial Attacks using Jacobian Regularizationcited by 88
- 2015Learning with a Strong Adversarycited by 68
- 2014Global convergence of the Heavy-ball method for convex optimizationcited by 60
- 2017NAG: Network for Adversary Generationcited by 51
- 2016Stochastic Heavy Ballcited by 40
- 2018Domain Adversarial Training for Accented Speech Recognitioncited by 40
- 2019Adversarial Examples in Modern Machine Learning: A Reviewcited by 36
- 2020EMPIR: Ensembles of Mixed Precision Deep Networks for Increased Robustness against Adversarial Attackscited by 28
- 2016Nesterov's Accelerated Gradient and Momentum as approximations to Regularised Update Descentcited by 26
- 2017Regularizing deep networks using efficient layerwise adversarial trainingcited by 24
- 2021Differentially Private Bayesian Neural Networks on Accuracy, Privacy and Reliabilitycited by 6
Built on by
Citing papers per year: 2022: 1.
1 paper.