On the Transferability of Winning Tickets in Non-Natural Image Datasets
Not on the map. Why?
Abstract (arXiv)
We study the generalization properties of pruned neural networks that are the winners of the lottery ticket hypothesis on datasets of natural images. We analyse their potential under conditions in which training data is scarce and comes from a non-natural domain. Specifically, we investigate whether pruned models that are found on the popular CIFAR-10/100 and Fashion-MNIST datasets, generalize to seven different datasets that come from the fields of digital pathology and digital heritage. Our results show that there are significant benefits in transferring and training sparse architectures over larger parametrized models, since in all of our experiments pruned networks, winners of the lottery ticket hypothesis, significantly outperform their larger unpruned counterparts. These results suggest that winning initializations do contain inductive biases that are generic to some extent, although, as reported by our experiments on the biomedical datasets, their generalization properties can be more limiting than what has been so far observed in the literature.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 4; 2024: 1; 2025: 1.
10 papers.
- 2022DiSparse: Disentangled Sparsification for Multitask Model Compressioncited by 14
- 2021Universality of Winning Tickets: A Renormalization Group Perspectivecited by 8
- 2021Sifting out the features by pruning: Are convolutional networks the winning lottery ticket of fully connected ones?cited by 3
- 2022Strong Lottery Ticket Hypothesis with varepsilon--perturbationcited by 3
- 2023Towards Compute-Optimal Transfer Learningcited by 2
- 2023Pruning at Initialization -- A Sketching Perspectivecited by 2
- 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learningcited by 2
- 2023Considering Layerwise Importance in the Lottery Ticket Hypothesiscited by 1
- 2023Iterative Magnitude Pruning as a Renormalisation Group: A Study in The Context of The Lottery Ticket Hypothesiscited by 1
- 2024On How Iterative Magnitude Pruning Discovers Local Receptive Fields in Fully Connected Neural Networkscited by 1
- 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learning9 Aug 2025
- 2024On How Iterative Magnitude Pruning Discovers Local Receptive Fields in Fully Connected Neural Networks9 Dec 2024
- 2023Iterative Magnitude Pruning as a Renormalisation Group: A Study in The Context of The Lottery Ticket Hypothesis6 Aug 2023
- 2023Pruning at Initialization -- A Sketching Perspective27 May 2023
- 2023Towards Compute-Optimal Transfer Learning25 Apr 2023
- 2023Considering Layerwise Importance in the Lottery Ticket Hypothesis22 Feb 2023
- 2022Strong Lottery Ticket Hypothesis with varepsilon--perturbation29 Oct 2022
- 2022DiSparse: Disentangled Sparsification for Multitask Model Compression9 Jun 2022
- 2021Universality of Winning Tickets: A Renormalization Group Perspective7 Oct 2021
- 2021Sifting out the features by pruning: Are convolutional networks the winning lottery ticket of fully connected ones?27 Apr 2021