Towards Compute-Optimal Transfer Learning
Not on the map. Why?
Abstract (arXiv)
The field of transfer learning is undergoing a significant shift with the introduction of large pretrained models which have demonstrated strong adaptability to a variety of downstream tasks. However, the high computational and memory requirements to finetune or use these models can be a hindrance to their widespread use. In this study, we present a solution to this issue by proposing a simple yet effective way to trade computational efficiency for asymptotic performance which we define as the performance a learning algorithm achieves as compute tends to infinity. Specifically, we argue that zero-shot structured pruning of pretrained models allows them to increase compute efficiency with minimal reduction in performance. We evaluate our method on the Nevis'22 continual learning benchmark that offers a diverse set of transfer scenarios. Our results show that pruning convolutional filters of pretrained models can lead to more than 20% performance improvement in low computational regimes.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 18 references that are in the map. First posted on arXiv 25 Apr 2023.
Builds on
17 of 18 references.
References · 17
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning multiple visual domains with residual adapterscited by 553
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2020Transfer Learning in Deep Reinforcement Learning: A Surveycited by 259
- 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
- 2019Sparse Transfer Learning via Winning Lottery Ticketscited by 27
- 2022Coarsening the Granularity: Towards Structurally Sparse Lottery Ticketscited by 27
- 2022Winning the Lottery Ahead of Time: Efficient Early Network Pruningcited by 21
- 2022NEVIS'22: A Stream of 100 Tasks Sampled from 30 Years of Computer Vision Researchcited by 18
5 more
- 2022DiSparse: Disentangled Sparsification for Multitask Model Compressioncited by 14
- 2020On Iterative Neural Network Pruning, Reinitialization, and the Similarity of Maskscited by 13
- 2020On the Transferability of Winning Tickets in Non-Natural Image Datasetscited by 10
- 2022Learning to Win Lottery Tickets in BERT Transfer via Task-agnostic Mask Trainingcited by 10
- 2020Bespoke vs. Pret-`a-Porter Lottery Tickets: Exploiting Mask Similarity for Trainable Sub-Network Findingcited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.