mlsanityData to 7 Oct 2026

How Well Do Sparse Imagenet Models Transfer?

arXiv 2111.13445 ↗First posted 26 Nov 2021cs.CV cs.AI cs.LGcited by 50

Not on the map. Why?

Abstract (arXiv)

Transfer learning is a classic paradigm by which models pretrained on large "upstream" datasets are adapted to yield good results on "downstream" specialized datasets. Generally, more accurate models on the "upstream" dataset tend to provide better transfer accuracy "downstream". In this work, we perform an in-depth investigation of this phenomenon in the context of convolutional neural networks (CNNs) trained on the ImageNet dataset, which have been pruned - that is, compressed by sparsifying their connections. We consider transfer using unstructured pruned models obtained by applying several state-of-the-art pruning methods, including magnitude-based, second-order, re-growth, lottery-ticket, and regularization approaches, in the context of twelve standard transfer tasks. In a nutshell, our study shows that sparse models can match or even outperform the transfer performance of dense models, even at high sparsities, and, while doing so, can lead to significant inference and even training speedups. At the same time, we observe and analyze significant differences in the behaviour of different pruning methods.

Key facts. Cited by 50 papers in the map (data through 7 Oct 2026). Builds on 46 of its 75 references that are in the map. First posted on arXiv 26 Nov 2021.

Builds on

46 of 75 references.

References · 46

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  4. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  5. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  6. 2016Wide Residual Networkscited by 3,057
  7. 2018YOLOv3: An Incremental Improvementcited by 2,652
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2013Describing Textures in the Wildcited by 2,110
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  11. 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
  12. 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,507
34 more
  1. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  2. 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
  3. 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
  4. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  5. 2018Do Better ImageNet Models Transfer Better?cited by 560
  6. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  7. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  8. 2019The State of Sparsity in Deep Neural Networkscited by 471
  9. 2019YOLACT: Real-time Instance Segmentationcited by 441
  10. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  11. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
  12. 2020Are we done with ImageNet?cited by 329
  13. 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 315
  14. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  15. 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
  16. 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 259
  17. 2021Accelerating Sparse Deep Neural Networkscited by 213
  18. 2019What Do Compressed Deep Neural Networks Forget?cited by 164
  19. 2020Characterising Bias in Compressed Modelscited by 162
  20. 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
  21. 2020Dynamic Model Pruning with Feedbackcited by 125
  22. 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
  23. 2020On Robustness and Transferability of Convolutional Neural Networkscited by 98
  24. 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
  25. 2019Fast Sparse ConvNetscited by 86
  26. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  27. 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
  28. 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 58
  29. 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
  30. 2021Factors of Influence for Transfer Learning across Diverse Appearance Domains and Task Typescited by 54
  31. 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
  32. 2020The Lottery Ticket Hypothesis for Object Recognitioncited by 34
  33. 2019Sparse Transfer Learning via Winning Lottery Ticketscited by 27
  34. 2016Training Skinny Deep Neural Networks with Iterative Hard Thresholding Methodscited by 15

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 5; 2023: 17; 2024: 12; 2025: 9; 2026: 7.

50 papers.

Sort:

By area:

  1. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
  2. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  3. 2022Efficient Methods for Natural Language Processing: A Surveycited by 78
  4. 2023E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuningcited by 70
  5. 2023Dynamic Sparse Training with Structured Sparsitycited by 36
  6. 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
  7. 2024Facing the Elephant in the Room: Visual Prompt Tuning or Full Finetuning?cited by 31
  8. 2024Visual Fourier Prompt Tuningcited by 30
  9. 2025Visual Instance-aware Prompt Tuningcited by 29
  10. 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
  11. 2024A Survey of Lottery Ticket Hypothesiscited by 23
  12. 2024FIARSE: Model-Heterogeneous Federated Learning via Importance-Aware Submodel Extractioncited by 21
38 more
  1. 2025Prompt-based Adaptation in Large-scale Vision Models: A Surveycited by 21
  2. 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 17
  3. 2024Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Promptscited by 15
  4. 2023SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networkscited by 12
  5. 2023Bias in Pruned Vision Models: In-Depth Analysis and Countermeasurescited by 11
  6. 2023Knowledge Distillation Performs Partial Variance Reductioncited by 11
  7. 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
  8. 2023Accelerating Deep Neural Networks via Semi-Structured Activation Sparsitycited by 10
  9. 2024Multilingual Brain Surgeon: Large Language Models Can be Compressed Leaving No Language Behindcited by 10
  10. 2024Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruningcited by 10
  11. 2022Federated Progressive Sparsification (Purge, Merge, Tune)+cited by 8
  12. 2025Visual Variational Autoencoder Prompt Tuningcited by 8
  13. 2022CrAM: A Compression-Aware Minimizercited by 7
  14. 2023Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiencycited by 7
  15. 2024Which Backbone to Use: A Resource-efficient Domain Specific Comparison for Computer Visioncited by 5
  16. 2025Revisit Visual Prompt Tuning: The Expressiveness of Prompt Expertscited by 5
  17. 2026When Priors Backfire: On the Vulnerability of Unlearnable Examples to Pretrainingcited by 5
  18. 2023Towards Optimal Compression: Joint Pruning and Quantizationcited by 3
  19. 2023Robust Tickets Can Transfer Better: Drawing More Transferable Subnetworks in Transfer Learningcited by 3
  20. 2023Uncovering the Hidden Cost of Model Compressioncited by 3
  21. 20243D Point Cloud Network Pruning: When Some Weights Do not Mattercited by 3
  22. 2025HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMscited by 3
  23. 2025Token Coordinated Prompt Attention is Needed for Visual Promptingcited by 3
  24. 2022SD-Conv: Towards the Parameter-Efficiency of Dynamic Convolutioncited by 2
  25. 2023Vision Models Can Be Efficiently Specialized via Few-Shot Task-Aware Compressioncited by 2
  26. 2024AdaptGCD: Multi-Expert Adapter Tuning for Generalized Category Discoverycited by 2
  27. 2025SliceFine: The Universal Winning-Slice Hypothesis for Pretrained Networkscited by 2
  28. 2023oBERTa: Improving Sparse Transfer Learning via improved initialization, distillation, and pruning regimescited by 1
  29. 2025VIPAMIN: Visual Prompt Initialization via Embedding Selection and Subspace Expansioncited by 1
  30. 2026Layer-Specific Prompt Fusion Discovery via Differentiable Search in Vision Foundation Modelscited by 1
  31. 2024Robustness to distribution shifts of compressed networks for edge devicescited by 0
  32. 2024Inducing Semi-Structured Sparsity by Masking for Efficient Model Inference in Convolutional Networkscited by 0
  33. 2025FlexiSAGA: A Flexible Systolic Array GEMM Accelerator for Sparse and Dense Processingcited by 0
  34. 2026Representation-Aligned Multi-Scale Personalization for Federated Learningcited by 0
  35. 2026Lottery Tickets Are Not Deployment Ticketscited by 0
  36. 2026Adapting Vision Foundation Models with Cascaded Semanticscited by 0
  37. 2026ES-VP : Energy-Shaped Dynamic Visual Prompting for Efficient Model Adaptationcited by 0
  38. 2026Coarse-Graining Hidden Representations: Unsupervised Neuron Selection via Mapping Entropycited by 0