Data-Efficient Double-Win Lottery Tickets from Robust Pre-training
Not on the map. Why?
Abstract (arXiv)
Pre-training serves as a broadly adopted starting point for transfer learning on various downstream tasks. Recent investigations of lottery tickets hypothesis (LTH) demonstrate such enormous pre-trained models can be replaced by extremely sparse subnetworks (a.k.a. matching subnetworks) without sacrificing transferability. However, practical security-crucial applications usually pose more challenging requirements beyond standard transfer, which also demand these subnetworks to overcome adversarial vulnerability. In this paper, we formulate a more rigorous concept, Double-Win Lottery Tickets, in which a located subnetwork from a pre-trained model can be independently transferred on diverse downstream tasks, to reach BOTH the same standard and robust generalization, under BOTH standard and adversarial training regimes, as the full pre-trained model can do. We comprehensively examine various pre-training mechanisms and find that robust pre-training tends to craft sparser double-win lottery tickets with superior performance over the standard counterparts. For example, on downstream CIFAR-10/100 datasets, we identify double-win matching subnetworks with the standard, fast adversarial, and adversarial pre-training from ImageNet, at 89.26%/73.79%, 89.26%/79.03%, and 91.41%/83.22% sparsity, respectively. Furthermore, we observe the obtained double-win lottery tickets can be more data-efficient to transfer, under practical data-limited (e.g., 1% and 10%) downstream schemes. Our results show that the benefits from robust pre-training are amplified by the lottery ticket scheme, as well as the data-limited transfer setting. Codes are available at https://github.com/VITA-Group/Double-Win-LTH.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 57 of its 70 references that are in the map. First posted on arXiv 9 Jun 2022.
Builds on
57 of 70 references.
References · 57
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 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
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
38 more
- 2016Adversarial Machine Learning at Scalecited by 934
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2019Adversarial Training for Free!cited by 638
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2018Rethinking the Value of Network Pruningcited by 595
- 2017Countering Adversarial Images using Input Transformationscited by 517
- 2020Overfitting in adversarially robust deep learningcited by 504
- 2017Feature Squeezing: Detecting Adversarial Examples in Deep Neural Networkscited by 484
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2018Rethinking ImageNet Pre-trainingcited by 376
- 2017Defense against Adversarial Attacks Using High-Level Representation Guided Denoisercited by 329
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 315
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2020Attacks Which Do Not Kill Training Make Adversarial Learning Strongercited by 242
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2020Understanding and Improving Fast Adversarial Trainingcited by 213
- 2016A study of the effect of JPG compression on adversarial imagescited by 196
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 182
- 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
- 2018Stochastic Activation Pruning for Robust Adversarial Defensecited by 171
- 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
- 2017Towards Robust Neural Networks via Random Self-ensemblecited by 158
- 2020Adversarial Robustness: From Self-Supervised Pre-Training to Fine-Tuningcited by 152
- 2020Robust Pre-Training by Adversarial Contrastive Learningcited by 144
- 2021A Unified Lottery Ticket Hypothesis for Graph Neural Networkscited by 118
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
- 2019Asymmetric Valleys: Beyond Sharp and Flat Local Minimacited by 90
- 2019Fast Sparse ConvNetscited by 86
- 2020EarlyBERT: Efficient BERT Training via Early-bird Lottery Ticketscited by 79
- 2021Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?cited by 75
- 2019Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLPcited by 73
- 2019Model Compression with Adversarial Robustness: A Unified Optimization Frameworkcited by 71
- 2018Adv-BNN: Improved Adversarial Defense through Robust Bayesian Neural Networkcited by 68
- 2019The Difficulty of Training Sparse Neural Networkscited by 62
- 2021A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustnesscited by 62
50 most cited of 57 All 57 (JSON)
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 2.
5 papers.
- 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
- 2024A Survey of Lottery Ticket Hypothesiscited by 23
- 2023A Survey on the Robustness of Computer Vision Models against Common Corruptionscited by 20
- 2024Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustnesscited by 11
- 2022DASS: Differentiable Architecture Search for Sparse neural networkscited by 2
- 2024Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustness3 Oct 2024
- 2024A Survey of Lottery Ticket Hypothesis7 Mar 2024
- 2023A Survey on the Robustness of Computer Vision Models against Common Corruptions10 May 2023
- 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researchers6 Feb 2023
- 2022DASS: Differentiable Architecture Search for Sparse neural networks14 Jul 2022