Boosting Fast Adversarial Training with Learnable Adversarial Initialization
Xiaojun Jia, Yong Zhang, Baoyuan Wu, Jue Wang, Xiaochun Cao

TL;DR
This paper introduces a novel sample-dependent adversarial initialization for fast adversarial training, significantly improving robustness while maintaining efficiency, by jointly optimizing a generative network and the target model.
Contribution
It proposes a learnable, sample-dependent initialization method for fast adversarial training, enhancing robustness without increasing computational cost.
Findings
Outperforms state-of-the-art fast AT methods on four benchmarks.
Achieves robustness comparable to multi-step AT methods.
Demonstrates the effectiveness of learnable initialization in adversarial training.
Abstract
Adversarial training (AT) has been demonstrated to be effective in improving model robustness by leveraging adversarial examples for training. However, most AT methods are in face of expensive time and computational cost for calculating gradients at multiple steps in generating adversarial examples. To boost training efficiency, fast gradient sign method (FGSM) is adopted in fast AT methods by calculating gradient only once. Unfortunately, the robustness is far from satisfactory. One reason may arise from the initialization fashion. Existing fast AT generally uses a random sample-agnostic initialization, which facilitates the efficiency yet hinders a further robustness improvement. Up to now, the initialization in fast AT is still not extensively explored. In this paper, we boost fast AT with a sample-dependent adversarial initialization, i.e., an output from a generative network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
