paper-with-me

Papers

Data-Efficient Double-Win Lottery Tickets from Robust Pre-training

2022-06-09 · Tianlong Chen, Zhenyu Zhang, Sijia Liu, Yang Zhang, Shiyu Chang, Zhangyang Wang

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.

📄 PDF Abstract BibTeX arXiv:2206.04762

Code (1)

vita-group/double-win-lth 공식 구현 pytorch

Tasks

Transfer Learning

Similar Papers 제목 키워드 기반

Rare Gems: Finding Lottery Tickets at Initialization

2022-02-24 · Kartik Sreenivasan, Jy-yong Sohn, Liu Yang, Matthew Grinde 외

Large neural networks can be pruned to a small fraction of their original size, with little loss in accuracy, by following a time-consuming "train, prune, re-train" approach. Frankle & Carbin conjecture that we can avoid…

When Layers Play the Lottery, all Tickets Win at Initialization

2023-01-25 · Artur Jordao, George Correa de Araujo, Helena de Almeida Maia, Helio Pedrini

Pruning is a standard technique for reducing the computational cost of deep networks. Many advances in pruning leverage concepts from the Lottery Ticket Hypothesis (LTH). LTH reveals that inside a trained dense network e…

All

Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks

2024-12-10 · Yanwei Yue, Guibin Zhang, Haoran Yang, Dawei Cheng

Graph Neural Networks (GNNs) demonstrate superior performance in various graph learning tasks, yet their wider real-world application is hindered by the computational overhead when applied to large-scale graphs. To addre…

DenoisingGraph Learning

Most Activation Functions Can Win the Lottery Without Excessive Depth

2022-05-04 · Rebekka Burkholz

The strong lottery ticket hypothesis has highlighted the potential for training deep neural networks by pruning, which has inspired interesting practical and theoretical insights into how neural networks can represent fu…

COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks

2022-12-24 · Md. Ismail Hossain, Mohammed Rakib, M. M. Lutfe Elahi, Nabeel Mohammed 외

Pruning refers to the elimination of trivial weights from neural networks. The sub-networks within an overparameterized model produced after pruning are often called Lottery tickets. This research aims to generate winnin…